無論如何這本書宣告著被報以掌聲有鑑於此決定性的書在一般的MPEG的容貌
標簽： MPEG
上傳時間： 2017-06-06
上傳用戶：liansi
類神經(jīng)網(wǎng)路 後傳遞演算法 沒有的人可以參考一下該文件
標簽： 算法
上傳時間： 2014-01-27
上傳用戶：hphh
relay Station 在中繼網(wǎng)路上的研究以及相關模擬辦法，演算法呈現(xiàn)
上傳時間： 2017-06-10
上傳用戶：jcljkh
This project attempts to stream high-speed ADC (or other digital) samples into a computer equipped with USB 2.0 CY3681FX2 AD9245
標簽： high-speed attempts computer equipped
上傳時間： 2017-06-11
上傳用戶：曹云鵬
//初始化 if(initscr() == NULL) { perror("initcurs") exit(EXIT_FAILURE) } //設置模式 cbreak() noecho() keypad(stdscr, TRUE) //建立窗口 win = newwin(h, w, 3, 20) box(win, 0, 0) keypad(win, TRUE) wmove(win, cury, curx) mvaddstr(16, 1, "Press arrow keys to move the cursor within the window.\n") mvaddstr(17, 1, "Press q to quit.\n") refresh() wrefresh(win)
標簽： EXIT_FAILURE initcurs initscr perror
上傳時間： 2013-12-20
上傳用戶：FreeSky
width = gdk_pixbuf_animation_get_width(ani) height = gdk_pixbuf_animation_get_height(ani) current_frame_list = gdk_pixbuf_animation_get_frames(ani) pixmap = gdk_pixmap_new(w->window, width, height, -1) clean_pixmap = gdk_pixmap_new(w->window, width, height, -1) if (w->style->bg_pixmap[GTK_STATE_NORMAL]) { GdkPixmap *bg = w->style->bg_pixmap[GTK_STATE_NORMAL] GdkGC *gc GdkGCValues values values.tile = bg values.fill = GDK_TILED gc = gdk_gc_new_with_values(w->window, &values, GDK_GC_FILL|GDK_GC_TILE) gdk_gc_set_ts_origin(gc, (w->allocation.width - width)/2, (w->allocation.height-height)/2) gdk_draw_rectangle(clean_pixmap,gc, TRUE, 0, 0, width, height) gdk_gc_destroy(gc) } else { gdk_draw_rectangle(clean_pixmap, w->style->bg_gc[GTK_STATE_NORMAL], TRUE, 0, 0, width, height) }
標簽： gdk_pixbuf_animation_get_height gdk_pixbuf_animation_get_width ani height
上傳時間： 2013-12-26
上傳用戶：thinode
倉庫下線條碼源碼，可以接收紅外掃描條碼，報表輸出
標簽：
上傳時間： 2014-12-05
上傳用戶：qq521
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
computer networking 計算機網(wǎng)路概論課本習題解答
標簽： networking computer
上傳時間： 2014-05-27
上傳用戶：電子世界
dsp hư ớ ng dẫ n giao tiế p LCD code viế t bằ ng C
上傳時間： 2017-06-17
上傳用戶：xuanjie
