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

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

libnxml-no-curl

  • Usage: void CRC(int*,int*,int,int) Input: XAR0:coded data(InputData)

    Usage: void CRC(int*,int*,int,int) Input: XAR0:coded data(InputData) XAR1:decoded CRC bits(CrcPoly) T0: Length of coded data(CodeOutlen) T1: Length of CRC bits(CrcPolylen) Return: NO Altered Registers: AC0-AC2,T2 Others: 8 bits of AC0 LSB is CRCcheck bit

    標簽: int InputData Usage Input

    上傳時間: 2017-06-24

    上傳用戶:ywqaxiwang

  • This functions computes SARMA or multiplicative (p,q) x (P,Q) models for (p,q,P,Q) in (pvec x qv

    This functions computes SARMA or multiplicative (p,q) x (P,Q) models for (p,q,P,Q) in (pvec x qvec x Pvec x Qvec) it returns the best according to AIC where AIC has been modified to account for fixed parameters x = input data pvec = vector of p s set pvec=[0] for no AR qvec = vector of q s set qvec=0[] for no MA Pvec = vector of P s Qvec = vector of Q s T period for multiplicative model

    標簽: multiplicative functions computes models

    上傳時間: 2017-06-30

    上傳用戶:Breathe0125

  • This tutorial was prepared for our freshman engineering students using the student version of MATLAB

    This tutorial was prepared for our freshman engineering students using the student version of MATLAB, because symbolic computations are covered in almost no introductory textbook. We are pleased to make it available to the international community, and would appreciate suggestions for its improvement. MATLAB’s symbolic engine permits the user to do things easily that are difficult or impossible to do numerically

    標簽: engineering tutorial prepared freshman

    上傳時間: 2014-01-02

    上傳用戶:lx9076

  • I implemented a perfect file transfer OCX client/server. I created a perfect function to parse and s

    I implemented a perfect file transfer OCX client/server. I created a perfect function to parse and split the data. The source file size is equal to destination. NO LOSS OF DATA in the packets!

    標簽: perfect implemented function transfer

    上傳時間: 2014-01-19

    上傳用戶:R50974

  • demonstrates how to use Delphi with WinLIRC. The source-code is included and there is also a binar

    demonstrates how to use Delphi with WinLIRC. The source-code is included and there is also a binary file. It runs with Delphi versions 3 through 7. No special components are required.

    標簽: demonstrates source-code included WinLIRC

    上傳時間: 2014-01-20

    上傳用戶:q123321

  • provided a modified version of this example that is designed to be more user friendly. It is coded i

    provided a modified version of this example that is designed to be more user friendly. It is coded in Delphi 7 Enterprise, and no special components are required.

    標簽: provided modified designed friendly

    上傳時間: 2017-07-10

    上傳用戶:xuanchangri

  • 【問題描述】 在一個N*N的點陣中

    【問題描述】 在一個N*N的點陣中,如N=4,你現在站在(1,1),出口在(4,4)。你可以通過上、下、左、右四種移動方法,在迷宮內行走,但是同一個位置不可以訪問兩次,亦不可以越界。表格最上面的一行加黑數字A[1..4]分別表示迷宮第I列中需要訪問并僅可以訪問的格子數。右邊一行加下劃線數字B[1..4]則表示迷宮第I行需要訪問并僅可以訪問的格子數。如圖中帶括號紅色數字就是一條符合條件的路線。 給定N,A[1..N] B[1..N]。輸出一條符合條件的路線,若無解,輸出NO ANSWER。(使用U,D,L,R分別表示上、下、左、右。) 2 2 1 2 (4,4) 1 (2,3) (3,3) (4,3) 3 (1,2) (2,2) 2 (1,1) 1 【輸入格式】 第一行是數m (n < 6 )。第二行有n個數,表示a[1]..a[n]。第三行有n個數,表示b[1]..b[n]。 【輸出格式】 僅有一行。若有解則輸出一條可行路線,否則輸出“NO ANSWER”。

    標簽: 點陣

    上傳時間: 2014-06-21

    上傳用戶:llandlu

  • This application provides much functionality for creating data-driven reports, including preview, gr

    This application provides much functionality for creating data-driven reports, including preview, graphics, and formatting. There is no documentation so you may have to work with it awhile, but there is a demo on how to use it, and the functionality is rich.

    標簽: functionality application data-driven including

    上傳時間: 2017-07-21

    上傳用戶:skhlm

  • Exploring C++ uses a series of self–directed lessons to divide C++ into bite–sized chunks that you c

    Exploring C++ uses a series of self–directed lessons to divide C++ into bite–sized chunks that you can digest as rapidly as you can swallow them. The book assumes only a basic understanding of fundamental programming concepts (variables, functions, expressions, statements) and requires no prior knowledge of C or any other particular language. It reduces the usually considerable complexity of C++. The included lessons allow you to learn by doing, as a participant of an interactive education session. You’ll master each step in a one sitting before you proceed to the next. Author Ray Lischner has designed questions to promote learning new material. And by responding to questions throughout the text, youll be engaged every step of the way.

    標簽: Exploring directed lessons series

    上傳時間: 2014-11-15

    上傳用戶:caiiicc

  • Because WDM networks are circuit switched loss networks blocking may occur because of lack of resour

    Because WDM networks are circuit switched loss networks blocking may occur because of lack of resources. Also in circuit switched networks many paths use the same links. This toolbox answers the question how different paths with different loads influence on each other and what is the blocking on each of the defined path. Toolbox is capable of computing blocking for three different WDM network types: with no wavelength conversion, with full wavelength conversion and with limited range wavelength conversion. It is worth noting that case for full conversion can be usefull for any circuit switched network without additional constraints (i.e. wavelength continuity constraint in WDM), for example telephone network. Toolbox contains also scripts for defining network structures (random networks, user defined networks) and traffic matrixes. Three graph algorithms for shortest path computation are also in this toolbox (they are used for traffic matrix creation).

    標簽: networks blocking switched Because

    上傳時間: 2017-07-28

    上傳用戶:zhangzhenyu

主站蜘蛛池模板: 东辽县| 栾川县| 肥城市| 绥棱县| 宝应县| 海安县| 凉山| 扎囊县| 三台县| 广水市| 贺州市| 托克逊县| 北川| 湘潭县| 许昌县| 敦化市| 公主岭市| 清新县| 林甸县| 彩票| 黑龙江省| 信宜市| 会泽县| 涞源县| 田阳县| 承德市| 谷城县| 克拉玛依市| 达拉特旗| 永寿县| 平武县| 安丘市| 阿克苏市| 桃江县| 榆中县| 鄂伦春自治旗| 阳曲县| 沽源县| 刚察县| 忻州市| 灵宝市|