This document contains a general overview in the first few sections as well as a more detailed reference in later sections for SVMpython. If you re already familiar with SVMpython, it s possible to get a pretty good idea of how to use the package merely by browsing through svmstruct.py and multiclass.py. This document provides a more in depth view of how to use the package. Note that this is not a conversion of SVMstruct to Python. It is merely an embedding of Python in existing C code. All code other than the user implemented API functions is still in C, including optimization.
標(biāo)簽： document contains detailed overview
上傳時(shí)間： 2013-12-14
上傳用戶：希醬大魔王
此范例可在window的DOS上執(zhí)行.有9各TASK分別秀出時(shí)間.執(zhí)行方式解壓鎖COPY到C碟然后BC45\SOURCE下修改TEST.C在BC45\TEST下執(zhí)行MAKETEST.BAT就可編繹出執(zhí)行檔 to show the starting time and completion time of each task in the first round.
標(biāo)簽： TEST MAKETEST window SOURCE
上傳時(shí)間： 2016-02-14
上傳用戶：zhouchang199
μC/OS-II Goals Probably the most important goal of μC/OS-II was to make it backward compatible with μC/OS (at least from an application’s standpoint). A μC/OS port might need to be modified to work with μC/OS-II but at least, the application code should require only minor changes (if any). Also, because μC/OS-II is based on the same core as μC/OS, it is just as reliable. I added conditional compilation to allow you to further reduce the amount of RAM (i.e. data space) needed by μC/OS-II. This is especially useful when you have resource limited products. I also added the feature described in the previous section and cleaned up the code. Where the book is concerned, I wanted to clarify some of the concepts described in the first edition and provide additional explanations about how μC/OS-II works. I had numerous requests about doing a chapter on how to port μC/OS and thus, such a chapter has been included in this book for μC/OS-II.
標(biāo)簽： OS-II compatible important Probably
上傳時(shí)間： 2013-12-02
上傳用戶：jkhjkh1982
The most up to date, comprehensive, and practical guide to Web services security, and the first to cover the final release of new standards SAML 1.1 and WS-Security.
標(biāo)簽： comprehensive and practical to
上傳時(shí)間： 2014-01-26
上傳用戶：小寶愛考拉
The first edition of this book ranks among the small (very small) number of books that I credit with significantly elevating my skills as a professional software devel-oper. Like the others, it was practical and easy to read, but loaded with important advice. Effective C++, Third Edition, continues that tradition. C++ is a very powerful programming language. If C gives you enough rope to hang yourself, C++ is a hard-ware store with lots of helpful people ready to tie knots for you. Mastering the points discussed in this book will definitely increase your ability to effectively use C++ and reduce your stress level.
標(biāo)簽： small edition credit number
上傳時(shí)間： 2013-12-29
上傳用戶：talenthn
編程題（15_01.c） 結(jié)構(gòu) struct student { long num char name[20] int score struct student *next } 鏈表練習(xí)： (1).編寫函數(shù)struct student * creat(int n),創(chuàng)建一個(gè)按學(xué)號升序排列的新鏈表,每個(gè)鏈表中的結(jié)點(diǎn)中 的學(xué)號、成績由鍵盤輸入，一共n個(gè)節(jié)點(diǎn)。 (2).編寫函數(shù)void print(struct student *head),輸出鏈表，格式每行一個(gè)結(jié)點(diǎn)，包括學(xué)號，姓名,分?jǐn)?shù)。 (3).編寫函數(shù)struct student * merge(struct student *a,struct student *b), 將已知的a,b兩個(gè)鏈表 按學(xué)號升序合并，若學(xué)號相同則保留成績高的結(jié)點(diǎn)。 (4).編寫函數(shù)struct student * del(struct student *a,struct student *b),從a鏈表中刪除b鏈表中有 相同學(xué)號的那些結(jié)點(diǎn)。 (5).編寫main函數(shù)，調(diào)用函數(shù)creat建立2個(gè)鏈表a,b,用print輸出倆個(gè)鏈表；調(diào)用函數(shù)merge升序合并2個(gè) 鏈表，并輸出結(jié)果；調(diào)用函數(shù)del實(shí)現(xiàn)a-b,并輸出結(jié)果。 a: 20304,xxxx,75, 20311,yyyy,89 20303,zzzz,62 20307,aaaa,87 20320,bbbb,79 b： 20302,dddd,65 20301,cccc,99 20311,yyyy,87 20323,kkkk,88 20307,aaaa,92 20322,pppp,83
標(biāo)簽： student struct score long
上傳時(shí)間： 2016-04-13
上傳用戶：zxc23456789
輕易學(xué)好C++編程技巧 - 進(jìn)楷 (香港科技大學(xué)筆記 19課) 內(nèi)容包括 1) base C++ review, 2) Pointers and Dynamic Objects, 3) Recursion,Linked Lists, 4) Stacks and Queues, 5) Algorithm Analysis, 6) Insertion Sort and Mergesort, 7) Quicksort, 8) Heaps and Heapsort, 9) Lower Bound of Sorting and Radix Sort, 10) Binary Trees and Binary Search Trees 11) AVL Trees, 12) B+ Trees 13) Graphs and Breadth-First Search 14) Depth-First Search 15) Connected Components, Directed Graphs, 16) Topological Sort 17) Hashing 18) Pattern Matching 19) Additional Review
標(biāo)簽： Pointers Dynamic Objects review
上傳時(shí)間： 2014-10-10
上傳用戶：chfanjiang
Magic works first hand source has been preserved for everyone to contribute.Magic hands 3.4 source code
標(biāo)簽： source Magic contribute preserved
上傳時(shí)間： 2014-11-27
上傳用戶：guanliya
一個(gè)簡單的C++詞法分析器，包括head文件和所有源碼，可直接運(yùn)行
標(biāo)簽： 分析器
上傳時(shí)間： 2013-12-08
上傳用戶：離殤
譚浩強(qiáng)C課件，tanhaoqiang C,first part
標(biāo)簽： 譚浩強(qiáng)
上傳時(shí)間： 2014-02-10
上傳用戶：l254587896
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
