虫虫首页| 资源下载| 资源专辑| 精品软件
登录| 注册

Double-Array

  • WSNs being energy constrained systems, one major problem is to employ the sensor nodes in such a man

    WSNs being energy constrained systems, one major problem is to employ the sensor nodes in such a manner so as to ensure maximum coverage and connectivity with minimal or optimal number of nodes and furthermore elongate network lifetime with maximum energy utilization. The problem addressed has been tackled for 1-D linear array and further extended to 2-Dimensions as stated in the next slides.

    标签: constrained systems problem energy

    上传时间: 2017-04-28

    上传用户:evil

  • 函数插值计算 分别输入已知节点的x,y值

    函数插值计算 分别输入已知节点的x,y值,待计算的节点的x值,以及显示结果的文本框。利用文本框和按钮上的事件触发一系列处理方法,包括把文本框里的字符串解析成double类型存放在数组中,以及利用lagrange插值公式计算出结果并填写在结果文本框中。

    标签: 函数 插值 计算

    上传时间: 2017-04-29

    上传用户:zm7516678

  • 矩阵运算.输入一个矩阵

    矩阵运算.输入一个矩阵,输入错误时报错.函数参数;待输入实型矩阵array,array的行列数i,j 返回值:0,表示输入错误;1,表示正确输入

    标签: 矩阵运算 矩阵 输入

    上传时间: 2014-01-20

    上传用户:二驱蚊器

  • Heapsort 1.A heap is a binary tree satisfying the followingconditions: -This tree is completely ba

    Heapsort 1.A heap is a binary tree satisfying the followingconditions: -This tree is completely balanced. -If the height of this binary tree is h, then leaves can be at level h or level h-1. -All leaves at level h are as far to the left as possible. -The data associated with all descendants of a node are smaller than the datum associated with this node. Implementation 1.using a linear array not a binary tree. -The sons of A(h) are A(2h) and A(2h+1). 2.time complexity: O(n log n)

    标签: followingconditions tree completely satisfying

    上传时间: 2017-05-25

    上传用户:2467478207

  • Generate Possion Dis. step1:Generate a random number between [0,1] step2:Let u=F(x)=1-[(1/

    Generate Possion Dis. step1:Generate a random number between [0,1] step2:Let u=F(x)=1-[(1/e)x] step3:Slove x=1/F(u) step4:Repeat Step1~Step3 by using different u,you can get x1,x2,x3,...,xn step5:If the first packet was generated at time [0], than the second packet will be generated at time [0+x1],The third packet will be generated at time [0+x1+x2], and so on …. Random-number generation 1.static method random from class Math -Returns doubles in the range 0.0 <= x < 1.0 2.class Random from package java.util -Can produce pseudorandom boolean, byte, float, double, int, long and Gaussian values -Is seeded with the current time of day to generate different sequences of numbers each time the program executes

    标签: Generate Possion between random

    上传时间: 2017-05-25

    上传用户:bibirnovis

  • This ar the basic programs that i did in highschool. From very simple to medium programs. From array

    This ar the basic programs that i did in highschool. From very simple to medium programs. From arrays to backtracking and graphs. Ther are more then 100 programs.

    标签: programs From highschool medium

    上传时间: 2014-12-04

    上传用户:youke111

  • DEV C++ 写的一个矩阵类

    DEV C++ 写的一个矩阵类,用列主元消去法求模的。类的构造函数接收矩阵的行列值或者是一个vector<vector<double> >类型的变量。没有用模板,数据类型是double.

    标签: DEV 矩阵

    上传时间: 2017-06-14

    上传用户:lht618

  • BP神经网络程序,C语言源代码 如下: #include "iostream.h" #include "iomanip.h" #include "stdlib.h" #include "ma

    BP神经网络程序,C语言源代码 如下: #include "iostream.h" #include "iomanip.h" #include "stdlib.h" #include "math.h" #include "stdio.h" #include "time.h" #include "fstream.h" #define N 120 //学习样本个数 #define IN 3 //输入层神经元数目 #define HN 2 //隐层神经元数目 #define ON 2 //输出层神经元数目 #define Z 20000 //旧权值保存-》每次study的权值都保存下来 double P[IN] //单个样本输入数据 double T[ON] //单个样本教师数据 double U11[IN][HN] //输入层至第一隐层权值 double V[HN][ON] //隐层至输出层权值 double X1[HN] //第一隐层的输入 double Y[ON] //输出层的输入 double H1[HN] //第一隐层的输出 double O[ON] //输出层的输出 double YU_HN1[HN] //第一隐层的阈值 double YU_ON[ON] //输出层的阈值 double err_m[N] //第m个样本的总误差 double a //学习效率 double alpha //动量因子

    标签: include iostream iomanip stdlib

    上传时间: 2017-06-15

    上传用户:xinzhch

  • The code performs a number (ITERS) of iterations of the Bailey s 6-step FFT alg

    The code performs a number (ITERS) of iterations of the Bailey s 6-step FFT algorithm (following the ideas in the CMU Task parallel suite). 1.- Generates an input signal vector (dgen) with size n=n1xn2 stored in row major order In this code the size of the input signal is NN=NxN (n=NN, n1=n2=N) 2.- Transpose (tpose) A to have it stored in column major order 3.- Perform independent FFTs on the rows (cffts) 4.- Scale each element of the resulting array by a factor of w[n]**(p*q) 5.- Transpose (tpose) to prepair it for the next step 6.- Perform independent FFTs on the rows (cffts) 7.- Transpose the resulting matrix The code requires nested Parallelism.

    标签: iterations performs Bailey number

    上传时间: 2014-01-05

    上传用户:libenshu01

  • Hi, this program is for my Java assignment.. this is a simple program which make use of JTable, MDI,

    Hi, this program is for my Java assignment.. this is a simple program which make use of JTable, MDI, text file, array, etc... if you like this program, pls vote me :D Just compile and run the program. javac FacultyBookList_Main java FacultyBookList_Main

    标签: program this assignment JTable

    上传时间: 2013-12-13

    上传用户:时代电子小智