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.
標(biāo)簽： constrained systems problem energy
上傳時(shí)間： 2017-04-28
上傳用戶：evil
函數(shù)插值計(jì)算 分別輸入已知節(jié)點(diǎn)的x,y值，待計(jì)算的節(jié)點(diǎn)的x值，以及顯示結(jié)果的文本框。利用文本框和按鈕上的事件觸發(fā)一系列處理方法，包括把文本框里的字符串解析成double類型存放在數(shù)組中，以及利用lagrange插值公式計(jì)算出結(jié)果并填寫在結(jié)果文本框中。
上傳時(shí)間： 2017-04-29
上傳用戶：zm7516678
矩陣運(yùn)算.輸入一個(gè)矩陣，輸入錯(cuò)誤時(shí)報(bào)錯(cuò).函數(shù)參數(shù)；待輸入實(shí)型矩陣array，array的行列數(shù)i，j 返回值：0，表示輸入錯(cuò)誤；1，表示正確輸入
上傳時(shí)間： 2014-01-20
上傳用戶：二驅(qū)蚊器
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)
標(biāo)簽： followingconditions tree completely satisfying
上傳時(shí)間： 2017-05-25
上傳用戶：2467478207
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
標(biāo)簽： Generate Possion between random
上傳時(shí)間： 2017-05-25
上傳用戶：bibirnovis
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.
標(biāo)簽： programs From highschool medium
上傳時(shí)間： 2014-12-04
上傳用戶：youke111
DEV C++ 寫的一個(gè)矩陣類，用列主元消去法求模的。類的構(gòu)造函數(shù)接收矩陣的行列值或者是一個(gè)vector<vector<double> >類型的變量。沒有用模板，數(shù)據(jù)類型是double.
上傳時(shí)間： 2017-06-14
上傳用戶：lht618
BP神經(jīng)網(wǎng)絡(luò)程序,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 //學(xué)習(xí)樣本個(gè)數(shù) #define IN 3 //輸入層神經(jīng)元數(shù)目 #define HN 2 //隱層神經(jīng)元數(shù)目 #define ON 2 //輸出層神經(jīng)元數(shù)目 #define Z 20000 //舊權(quán)值保存-》每次study的權(quán)值都保存下來 double P[IN] //單個(gè)樣本輸入數(shù)據(jù) double T[ON] //單個(gè)樣本教師數(shù)據(jù) double U11[IN][HN] //輸入層至第一隱層權(quán)值 double V[HN][ON] //隱層至輸出層權(quán)值 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個(gè)樣本的總誤差 double a //學(xué)習(xí)效率 double alpha //動(dòng)量因子
標(biāo)簽： include iostream iomanip stdlib
上傳時(shí)間： 2017-06-15
上傳用戶：xinzhch
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.
標(biāo)簽： iterations performs Bailey number
上傳時(shí)間： 2014-01-05
上傳用戶：libenshu01
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
標(biāo)簽： program this assignment JTable
上傳時(shí)間： 2013-12-13
上傳用戶：時(shí)代電子小智
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
