neural network utility is a Neural Networks library for the C++ Programmer. It is entirely object oriented and focuses on reducing tedious and confusing problems of programming neural networks. By this I mean that network layers are easily defined. An entire multi-layer network can be created in a few lines, and trained with two functions. Layers can be connected to one another easily and painlessly.
标签： Programmer Networks entirely network
上传时间： 2013-12-24
上传用户：liuchee
gcclib This gcc 1.40 suits for Linux kernel 0.11 - 0.95 Installtion hints ----------------- This suit contains include.taz, local.taz and this README file. You must download the bootimage and rootimage and install them first. The include.taz contains all the include files for using with gcc 1.40. The local.taz contains all the gcc tools & libs stored in two sepearted directories: /usr/local/lib /usr/local/bin You should copy the linux/ asm/ sys/ subdirectories into the include directory from the corresponding kernel source. Installation ------------ Goto the /usr directory. Untar the include.taz to the directory /usr/include. Untar the local.taz to the directory /usr/local. That s it! Example: -------- cd /usr tar zxvf include.taz tar zxvf local.taz
标签： Installtion gcclib kernel Linux
上传时间： 2014-03-12
上传用户：源码3
Batch version of the back-propagation algorithm. ％ Given a set of corresponding input-output pairs and an initial network ％ [W1,W2,critvec,iter]=batbp(NetDef,W1,W2,PHI,Y,trparms) trains the ％ network with backpropagation. ％ ％ The activation functions must be either linear or tanh. The network ％ architecture is defined by the matrix NetDef consisting of two ％ rows. The first row specifies the hidden layer while the second ％ specifies the output layer. ％
标签： back-propagation corresponding input-output algorithm
上传时间： 2016-12-27
上传用户：exxxds
Small calculater GUI This GUI takes 2 user chosen numbers and applies a matchmatical operation on the two numbers. Also shows save and load functionality.
标签： matchmatical calculater GUI operation
上传时间： 2013-12-19
上传用户：李彦东
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
标签： combinatorial assignment problem arises
上传时间： 2014-01-19
上传用户：BIBI
This book explains how to write device drivers for the newest members of the MicrosoftWindows family of operating systems using the Windows Driver Model (WDM). In this Introduction, I ll explain who should be reading this book, the organization of the book, and how to use the book most effectively. You ll also find a note on errors and a section on other resources you can use to learn about driver programming. Looking ahead, Chapter 1 explains how the two main branches of the Windows family operate internally, what a WDM device driver is, and how it relates to the rest of Windows.
标签： MicrosoftWindows the explains drivers
上传时间： 2014-01-04
上传用户：dongqiangqiang
Free open-source disk encryption software for Windows Vista/XP, Mac OS X, and Linux Main Features: * Creates a virtual encrypted disk within a file and mounts it as a real disk. * Encrypts an entire partition or storage device such as USB flash drive or hard drive. * Encrypts a partition or drive where Windows is installed (pre-boot authentication). * Encryption is automatic, real-time (on-the-fly) and transparent. * Provides two levels of plausible deniability, in case an adversary forces you to reveal the password: 1) Hidden volume (steganography) and hidden operating system. 2) No TrueCrypt volume can be identified (volumes cannot be distinguished from random data). * Encryption algorithms: AES-256, Serpent, and Twofish. Mode of operation: XTS. Further information regarding features of the software may be found in the:http://www.truecrypt.org/
标签： open-source encryption Features software
上传时间： 2013-12-20
上传用户：123啊
a MATLAB program which tries to correct situations in which a triangulation includes corner triangles, that is, triangles which have two sides on boundary
标签： which triangulation situations includes
上传时间： 2014-01-23
上传用户：cursor
To review what a metaball is, and how to render them and to describe a new optimization I ve made for rendering metaballs. For complex scenes, it can render hundreds of times faster, though I m certain others have discovered this trick as well. It does very slightly change the characteristic shape of the blobs, but there is no loss in image quality whatsoever. (I actually developed all this about two years ago, but just now felt like writing it all down, and had the time!)
标签： optimization and metaball describe
上传时间： 2013-12-27
上传用户：彭玖华
The basic principle using the branchand- bound strategy to solve the traveling salesperson optimization problem (TSP) consists of two parts. There is a way to split the solution space. There is a way to predict a lower bound for a class of solutions. There is also a way to find an upper bound of an optimal solution. If the lower bound of a solution exceeds this upper bound, this solution cannot be optimal. Thus, we should terminate the branching associated with this solution.
标签： salesperson principle branchand the
上传时间： 2017-02-19
上传用户：comua
