THIS CODE REGARDS TO THE USEING OF SUBNET COUNTING, YOUR CHARGING WILL BE COUNTED, THANK YOU.
標簽： CHARGING COUNTING REGARDS COUNTED
上傳時間： 2015-07-10
上傳用戶：zhyiroy
The intent of the software contained on this CD is to provide support for the material covered in the textbook. All programs have been developed and tested using MATLAB Version 5.2. Although the authors believe that all routines should be compatible with earlier versions of MATLAB, this may not be the case. The software is maintained and regularly updated through our Web-site at www.wpi.edu/ece/EM_RF_lab/book. It is assumed that the user has a basic knowledge of MATLAB. Support of MATLAB is maintained through the MathWorks, Inc. Web-site at www.mathworks.com.
標簽： contained the material software
上傳時間： 2015-07-11
上傳用戶：離殤
The intent of the software contained on this CD is to provide support for the material covered in the textbook. All programs have been developed and tested using MATLAB Version 5.2. Although the authors believe that all routines should be compatible with earlier versions of MATLAB, this may not be the case. The software is maintained and regularly updated through our Web-site at www.wpi.edu/ece/EM_RF_lab/book. It is assumed that the user has a basic knowledge of MATLAB. Support of MATLAB is maintained through the MathWorks, Inc. Web-site at www.mathworks.com.
標簽： contained the material software
上傳時間： 2013-12-30
上傳用戶：wweqas
Oracle PL/SQL Best Practices is a concise, easy-to-use summary of best practices in the program development process. It covers coding style, writing SQL in PL/SQL, data structures, control structures, exception handling, program and package construction, and built-in packages.
標簽： easy-to-use Practices practices concise
上傳時間： 2015-07-11
上傳用戶：gonuiln
A program to find frequent molecular substructures and discriminative fragments in a database of molecule descriptions. The algorithm is based on the Eclat algorithm for frequent item set mining.
標簽： discriminative substructures fragments molecular
上傳時間： 2014-01-20
上傳用戶：龍飛艇
A program to demonstrate the optimization process of particle swarm optimization. A two-dimensional objective function is visualized by level of grey: the lighter the color, the higher the function value. The particles are shown as red circles, their trajectory as red lines.
標簽： optimization two-dimensional demonstrate particle
上傳時間： 2013-12-22
上傳用戶：Andy123456
A program to demonstrate the optimization process of ant colony optimization for the traveling saleman problem (TSP). The cities are shown as red circles, the pheromone on the connections between them (fully connected graph) by gray lines. The darker the grey, the more pheromone is currently on the edge. During the optimization, the currently best found tour is drawn in red. To run the optimization, first create a random TSP, then create an ant colony, and finally run the optimization.
標簽： optimization demonstrate the traveling
上傳時間： 2015-07-12
上傳用戶：偷心的海盜
Programs to induce a naive possibilistic classifier (a possibilistic analog of the naive Bayes classifier) and to classify new data with an induced naive possibilistic classifier.
標簽： possibilistic naive classifier Programs
上傳時間： 2015-07-12
上傳用戶：蟲蟲蟲蟲蟲蟲
Synthesizable model of Atmel ATmega103 microcontroller. (VHDL IP)
標簽： microcontroller Synthesizable ATmega Atmel
上傳時間： 2013-11-30
上傳用戶：z754970244
Computes estimates for the number of forests of a graph, input as a 0-1 incidence matrix. Notes: Compile in C++, "g++ -o span_forest span_forest.c". The program does not demand that the matrix is symmetric with 0 diagonal, but uses only the upper triangular part.
標簽： estimates incidence Computes forests
上傳時間： 2013-12-26
上傳用戶：com1com2
