LIBSVM is an integrated software for support vector classification. LIBSVM provides a simple interface where users can easily link it with their own programs.
builds an alternate memory allocation scheme into ToyFDTD1. Contributed by John Schneider, it guarantees that the data arrays are contiguous, which the ToyFDTD1 scheme does not. Released 6 December, 1999.
Polynomial fit functions
=== === === ===
RegressionObject.cls contains a class that provides an easy way to add polynomial regression functionality to any application. If you just want linear regression or a very high degree, no matter: this class has good performance and scales seamlessly with the complexity of your problem.
包含一下內容:
* An extensible agent
* An SNMP library
* tools to request or set information from SNMP agents
* tools to generate and handle SNMP traps
* a version of the unix netstat command using SNMP
* a graphical Perl/Tk/SNMP based mib browser
Libgist is an implementation of the Generalized Search Tree, a template index structure that makes it easy to implement any type of hierarchical access method (AM).
隨機性發生器、冒泡分類和混洗一組12張牌的演示程序。
Demonstrates the use of a randomizer, bubble-sort and an array to "shuffle" a deck of 12 cards. I put it here for those of you who are trying to figure out how to shuffle with a randomizer without having the same card appear two-or-more times.
CC386 is a general-purpose 32-bit C compiler. It is not an optimizing compiler but given that the code generation is fairly good. There are two versions one is for MSDOS/DPMI and one is for Win32. The Win32 version has a full-blown IDE capable of editing, building, and debugging windows programs included with it. However at this time debugging support for MSDOS is rudimentary at best and there is no IDE for DOS.
the newest version, support windows.
OXCC is a multipass, interpreting C compiler with several language extensions. It generates an Architecture Neutral Format (ANF) output and comes with a couple of example back ends. Programmers are expected to write additional back ends for their specific needs.
Contains a complete archiver by Haruhiko Okumura. The archiver uses
an LZ engine whose output is compressed with static Huffman. The
file is chopped into pieces which all get their own independent
set of Huffman tree s. ARJ 2.41, ZIP 2.0 and PKZIP 2.04g use
essentially the same method. ZOO and LHA even use excactly the
same method.
