The C programming Language By Brian W. Kernighan and Dennis M. Ritchie. Published by Prentice-Hall in 1988 c創始人的經典著作，被譽為c語言圣經
標簽： M. W. Prentice-Hal programming
上傳時間： 2014-01-01
上傳用戶：dsgkjgkjg
W ireless rem ote control system for tower crane based on M SP430 and nRF905：介紹了一種基于無線遙測技術的塔吊遙控系統，該系統以MSP430超低功耗l6位微控制器和無 線收發芯片nRF905為核心。系統采用軟件編碼和硬件譯碼的方式提高了系統的抗干擾能力，系統發 射器采用定時掃描、接收器采用無記憶輸出控制方式，提高了系統可靠性，該系統可廣泛應用于塔吊等 一般的工業遙控系統中。
標簽： ireless control system based
上傳時間： 2013-12-15
上傳用戶：zhengzg
并行lu分解源程序，自帶初始輸入數據和運行結果
上傳時間： 2016-11-16
上傳用戶：1051290259
After the successful global introduction during the past decade of the second generation (2G) digital mobile communications systems, it seems that the third generation (3G) Universal Mobile Communication System (UMTS) has finally taken off, at least in some regions. The plethora of new services that are expected to be offered by this system requires the development of new paradigms in the way scarce radio resources should be managed. The Quality of Service (QoS) concept, which introduces in a natural way the service differentiation and the possibility of adapting the resource consumption to the specific service requirements, will open the door for the provision of advanced wireless services to the mass market.
標簽： the introduction successful generation
上傳時間： 2013-12-30
上傳用戶：qq21508895
這是ASUS EEPC 網卡驅動程式源碼 是研究linux driver的好材料
上傳時間： 2014-02-05
上傳用戶：waitingfy
數值分析中LU分解法解結構矩陣問題，Visual C#源代碼
上傳時間： 2016-12-01
上傳用戶：gxrui1991
利用數值分析中LU、LDLT、JACOBI、GAUSS_SEIDEL、RELAXATION各種方法解結構矩陣問題，Visual C#源代碼
標簽： GAUSS_SEIDEL RELAXATION JACOBI LDLT
上傳時間： 2016-12-01
上傳用戶：libenshu01
Sparse LU Decomposition using FPGA，使用fpga實現lu分解的算法實現
標簽： Decomposition Sparse using FPGA
上傳時間： 2013-12-19
上傳用戶：WMC_geophy
剛才郵箱寫錯了 冪法反冪法程序作業 帶LU分解子程序 DOLITTLE分解法等
上傳時間： 2016-12-08
上傳用戶：gaojiao1999
function [U,center,result,w,obj_fcn]= fenlei(data) [data_n,in_n] = size(data) m= 2 ％ Exponent for U max_iter = 100 ％ Max. iteration min_impro =1e-5 ％ Min. improvement c=3 [center, U, obj_fcn] = fcm(data, c) for i=1:max_iter if F(U)>0.98 break else w_new=eye(in_n,in_n) center1=sum(center)/c a=center1(1)./center1 deta=center-center1(ones(c,1),:) w=sqrt(sum(deta.^2)).*a for j=1:in_n w_new(j,j)=w(j) end data1=data*w_new [center, U, obj_fcn] = fcm(data1, c) center=center./w(ones(c,1),:) obj_fcn=obj_fcn/sum(w.^2) end end display(i) result=zeros(1,data_n) U_=max(U) for i=1:data_n for j=1:c if U(j,i)==U_(i) result(i)=j continue end end end
標簽： data function Exponent obj_fcn
上傳時間： 2013-12-18
上傳用戶：ynzfm
