亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

蟲蟲首頁| 資源下載| 資源專輯| 精品軟件
登錄| 注冊

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

    上傳用戶:時代電子小智

主站蜘蛛池模板: 安福县| 理塘县| 蛟河市| 衡山县| 琼结县| 巴青县| 确山县| 黄浦区| 丹寨县| 松原市| 林甸县| 南靖县| 淳化县| 阜阳市| 壶关县| 乡城县| 抚顺市| 三门峡市| 宿迁市| 盐池县| 西城区| 潜江市| 黎城县| 黄浦区| 昌乐县| 阿克陶县| 玛曲县| 华亭县| 兴化市| 禄丰县| 西昌市| 温宿县| 偃师市| 威远县| 平湖市| 紫金县| 南木林县| 福清市| 思南县| 柏乡县| 西乌珠穆沁旗|