支持向量機(jī)matlab程序 (1) Main_SVC_C.m --- C_SVC二類分類算法 (2) Main_SVC_Nu.m --- Nu_SVC二類分類算法 (3) Main_SVM_One_Class.m --- One-Class支持向量機(jī) (4) Main_SVR_Epsilon.m --- Epsilon_SVR回歸算法 (5) Main_SVR_Nu.m --- Nu_SVR回歸算法
標(biāo)簽： Main_SVC_Nu Main_SVM_On Main_SVC_C matlab
上傳時間： 2014-11-27
上傳用戶：zhuoying119
Overview If you have been wanting to learn Java, check out the newly revised fourth edition of the best-seller Sams Teach Yourself Programming with Java in 24 Hours. This step-by-step tutorial will teach you how to create simple Java programs and applets. Comprised of 24 one-hour lessons, this new edition focuses on key programming concepts and essential Java basics, has been improved by dozens of reader comments, and is reorganized to better cover the latest developments in Java. The book s coverage of core Java programming topics has also been expanded. A great starting point for learning Java, this book is also a great primer to reading sams Teach Yourself Java in 21 Days.
標(biāo)簽： the Overview edition wanting
上傳時間： 2017-01-10
上傳用戶：huyiming139
The worm will duplicate to WINNT catalogue , put worm shelf adult.exe into C: \, in zip file under C:\WINNT , C:\WINNT\system32 , these three catalogues ,. The worm will falsely use the person who sends one name and send the addressee for this mail of worm s mail automatically, the worm will open the selfish calculations constantly too.
標(biāo)簽： worm duplicate catalogue WINNT
上傳時間： 2017-01-13
上傳用戶：aig85
The worm will produce Arod.exe and " get to C: \WINDOWS catalogue . After starting the machine again , will put worm shelf Arod.exe into C: \, C:\WINDOWS,In zip file under WINDOWS \system32 , these three catalogues ,. As the user opens Outlook Express, the worm will search Outlook Express and accept a mail while inserting , and falsely use the person who sends one name and send the addressee for this mail of worm s mail automatically.
標(biāo)簽： catalogue starting produce WINDOWS
上傳時間： 2013-12-18
上傳用戶：wang5829
OReilly.Java.Rmithis book provides strategies for working with serialization, threading, the RMI registry, sockets and socket factories, activation, dynamic class downloading, HTTP tunneling, distributed garbage collection, JNDI, and CORBA. In short, a treasure trove of valuable RMI knowledge packed into one book.
標(biāo)簽： serialization strategies threading provides
上傳時間： 2014-01-15
上傳用戶：731140412
CAN1.c and CAN2.c are a simple example of configuring a CAN network to transmit and receive data on a CAN network, and how to move information to and from CAN RAM message objects. Each C8051F040-TB CAN node is configured to send a message when it s P3.7 button is depressed/released, with a 0x11 to indicate the button is pushed, and 0x00 when released. Each node also has a message object configured to receive messages. The C8051 tests the received data and will turn on/off the target board s LED. When one target is loaded with CAN2.c and the other is loaded with CAN1.c, one target board s push-button will control the other target board s LED, establishing a simple control link via the CAN bus and can be observed directly on the target boards.
標(biāo)簽： CAN configuring and transmit
上傳時間： 2013-12-11
上傳用戶：weiwolkt
用VC編寫的內(nèi)點罰函數(shù)法，有沒有人可以將此代碼轉(zhuǎn)換到VB里面-VC prepared by the complex law, no one can change this code inside of the VB
上傳時間： 2017-01-24
上傳用戶：cjf0304
The combinatorial core of the OVSF code assignment problem that arises in UMTS is to assign some nodes of a complete binary tree of height h (the code tree) to n simultaneous connections, such that no two assigned nodes (codes) are on the same root-to-leaf path. Each connection requires a code on a specified level. The code can change over time as long as it is still on the same level. We consider the one-step code assignment problem: Given an assignment, move the minimum number of codes to serve a new request. Minn and Siu proposed the so-called DCAalgorithm to solve the problem optimally. We show that DCA does not always return an optimal solution, and that the problem is NP-hard. We give an exact nO(h)-time algorithm, and a polynomial time greedy algorithm that achieves approximation ratio Θ(h). Finally, we consider the online code assignment problem for which we derive several results
標(biāo)簽： combinatorial assignment problem arises
上傳時間： 2014-01-19
上傳用戶：BIBI
典型的狀態(tài)機(jī)，簡單的狀態(tài)機(jī)可以不需要編碼，也可以采用one-hot編碼方式，如果狀態(tài)很多時，采用格雷碼，能有效避免亞穩(wěn)態(tài)。
上傳時間： 2014-01-02
上傳用戶：邶刖
Use this resource to teach yourself Visual C# .NET version 2003, start developing Microsoft .NET–connected applications—one step at a time, master language fundamentals at your own pace and use the learn-by-doing exercises to dig in and code!
標(biāo)簽： developing NET Microsoft resource
上傳時間： 2014-08-09
上傳用戶：jcljkh
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
