虫虫首页| 资源下载| 资源专辑| 精品软件
登录| 注册

MICROS<b>OF</b>T

  • Copyright© 2004 Sergiu Dumitriu, Marta Gî rdea, Că tă lin Hriţ cu Permission is

    Copyright© 2004 Sergiu Dumitriu, Marta Gî rdea, Că tă lin Hriţ cu Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled "GNU Free Documentation License" All brand names, product names, or trademarks belong to their respective holders.

    标签: Permission Copyright 259 Dumitriu

    上传时间: 2015-04-02

    上传用户:jackgao

  • Description: FASBIR(Filtered Attribute Subspace based Bagging with Injected Randomness) is a variant

    Description: FASBIR(Filtered Attribute Subspace based Bagging with Injected Randomness) is a variant of Bagging algorithm, whose purpose is to improve accuracy of local learners, such as kNN, through multi-model perturbing ensemble. Reference: Z.-H. Zhou and Y. Yu. Ensembling local learners through multimodal perturbation. IEEE Transactions on Systems, Man, and Cybernetics - Part B: Cybernetics, 2005, vol.35, no.4, pp.725-735.

    标签: Description Randomness Attribute Filtered

    上传时间: 2015-04-10

    上传用户:ynzfm

  • prolog 找路例子程序: === === === === === === Part 1-Adding connections Part 2-Simple Path example

    prolog 找路例子程序: === === === === === === Part 1-Adding connections Part 2-Simple Path example | ?- path1(a,b,P,T). will produce the response: T = 15 P = [a,b] ? Part 3 - Non-repeating path As an example, the query: ?- path2(a,h,P,T). will succeed and may produce the bindings: P = [a,depot,b,d,e,f,h] T = 155 Part 4 - Generating a path below a cost threshold As an example, the query: ?- path_below_cost(a,[a,b,c,d,e,f,g,h],RS,300). returns: RS = [a,b,depot,c,d,e,g,f,h] ? RS = [a,c,depot,b,d,e,g,f,h] ? no ==================================

    标签: Part connections example prolog

    上传时间: 2015-04-24

    上传用户:ljt101007

  • DELPHI basicCtrl+NUM 直接将光标跳到NUM处

    DELPHI basicCtrl+NUM 直接将光标跳到NUM处,NUM是用Ctrl+Shift+NUM设置的标号。 NUM不能用小键盘。 Ctrl+Home 将光标移至文件头。 Ctrl+End 将光标移至文件尾。 Ctrl+B Buffer List窗口。 Ctrl+I 同Tab键。 Ctrl+M 同Enter键。 Ctrl+N 同Enter键,但光标位置保持不变。 Ctrl+T 删除光标右边的一个单词。 Ctrl+Y 删除光标所在行。 Ctrl+Shift+↑ 光标在函数体内时,将光标快速移至当前函数声明处。 Ctrl+Shift+↓ 光标在函数声明行时,将光标快速移至函数定义处。 Ctrl+Shift+C 声明一个过程或函数后,直接生成过程或函数的名称、begin、end Ctrl+Shift+E 光标在Edit窗口和Explorer窗口间切换。 Ctrl+Shift+G 插入GUID。 Ctrl+Shift+J 弹出Delphi语句提示窗口,选择所需语句将自动完成一条语句。 Ctrl+Shift+T 在光标行加入To-Do注释。 Ctrl+Shift+Y 删除光标之后至本行末尾之间的文本。 Ctrl+F3 Call Stack窗口。 Ctrl+F4 等于File菜单中的Close项。

    标签: basicCtrl NUM DELPHI 光标

    上传时间: 2014-11-26

    上传用户:kr770906

  • He was the first one (I noticed of) who coded a decrypter for yC 1.2 :)...good job. Also if it hasn

    He was the first one (I noticed of) who coded a decrypter for yC 1.2 :)...good job. Also if it hasn t full support yet >:-) So as I promised...here s the source code. I hope it helps someone.

    标签: decrypter noticed first coded

    上传时间: 2015-05-03

    上传用户:498732662

  • This example demonstrates how to erase, write, and read the on-chip 640-byte EEPROM Data Memory of t

    This example demonstrates how to erase, write, and read the on-chip 640-byte EEPROM Data Memory of the Analog Devices ADuC812, ADuC814, ADuC816, and ADuC824 devivces. This example includes a µ Vision2 Project with a target for each supported device.

    标签: demonstrates example on-chip EEPROM

    上传时间: 2015-05-04

    上传用户:wl9454

  • 检测windows下rootkit对文件的隐藏。some usermode overwrites first few bytes of ZwQueryDirectoryFile and that t

    检测windows下rootkit对文件的隐藏。some usermode overwrites first few bytes of ZwQueryDirectoryFile and that trick will fail then :( So, you will probably need a small database of the correct indexes for all Windows versions

    标签: ZwQueryDirectoryFile overwrites usermode windows

    上传时间: 2014-12-08

    上传用户:lps11188

  • Although there has been a lot of AVL tree libraries available now, nearly all of them are meant to w

    Although there has been a lot of AVL tree libraries available now, nearly all of them are meant to work in the random access memory(RAM). Some of them do provide some mechanism for dumping the whole tree into a file and loading it back to the memory in order to make data in that tree persistent. It serves well when there s just small amount of data. When the tree is somewhat bigger, the dumping/loading process could take a lengthy time and makes your mission-critical program less efficient. How about an AVL tree that can directly use the disk for data storage ? If there s something like that, we won t need to read through the whole tree in order to pick up just a little bit imformation(a node), but read only the sectors that are neccssary for locating a certain node and the sectors in which that node lies. This is my initial motivation for writing a storage-media independent AVL Tree. However, as you step forth, you would find that it not only works fine with disks but also fine with memorys, too.

    标签: available libraries Although nearly

    上传时间: 2014-01-22

    上传用户:zhoujunzhen

  • ITU-T Recommendation V.90 98年9月版本 A DIGITAL MODEM AND ANALOGUE MODEM PAIR FOR USE ON THE PUBLIC SWI

    ITU-T Recommendation V.90 98年9月版本 A DIGITAL MODEM AND ANALOGUE MODEM PAIR FOR USE ON THE PUBLIC SWITCHED TELEPHONE NETWORK (PSTN) AT DATA SIGNALLING RATES OF UP TO 56 000 bit/s DOWNSTREAM AND UP TO 33 600 bit/s UPSTREAM

    标签: MODEM Recommendation ANALOGUE DIGITAL

    上传时间: 2014-01-17

    上传用户:hn891122

  • MFC Black Book Introduction: Are you an MFC programmer? Good. There are two types of MFC programme

    MFC Black Book Introduction: Are you an MFC programmer? Good. There are two types of MFC programmers. What kind are you? The first kind are the good programmers who write programs that conform to the way MFC wants you to do things. The second bunch are wild-eyed anarchists who insist on getting things done their way. Me, I’m in the second group. If you are in the same boat (or would like to be) this book is for you. This book won’t teach you MFC—not in the traditional sense. You should pick it up with a good understanding of basic MFC programming and a desire to do things differently. This isn’t a Scribble tutorial (although I will review some fundamentals in the first chapter). You will learn how to wring every drop from your MFC programs. You’ll discover how to use, abuse, and abandon the document/view architecture. If you’ve ever wanted custom archives, you’ll find that, too.

    标签: MFC Introduction programmer programme

    上传时间: 2015-05-30

    上传用户:youke111