classifier
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 23
morigin email classifier 0.93
morigin email classifier is a filter that classifies and tags email messages. more>>
morigin email classifier is a filter that classifies and tags email messages based on the DNS information of the system submitting the mail to your organization.
morigin email classifier can then be used to improve upon existing spam filters such as SpamAssassin.
<<lessmorigin email classifier can then be used to improve upon existing spam filters such as SpamAssassin.
Download (0.088MB)
Added: 2005-11-25 License: GPL (GNU General Public License) Price:
1428 downloads
Mail::Classifier::GrahamSpam 0.13
Mail::Classifier::GrahamSpam is a spam classification based on Paul Grahams algorithm. more>>
Mail::Classifier::GrahamSpam is a spam classification tool based on Paul Grahams algorithm.
SYNOPSIS
use Mail::Classifier::GrahamSpam;
$bb = Mail::Classifier::GrahamSpam->new();
$bb->bias( NOTSPAM, 2);
$bb->train( { spam.mbox => SPAM, notspam.mbox => NOTSPAM } );
my ($cat, $prob) = $bb->score( $msg );
ABSTRACT
Mail::Classifier::GrahamSpam - spam classification based on Paul Grahams algorithm
This class is a specific implementation of a Mail::Classifier that uses Naive Bayesian methods for associating messages with a category. The specific implemenation is based on the article "A Plan for Spam" by Paul Graham (thus the name).
For classic Graham, make sure to set bias on non-spam to 2.
While this class was designed to classify spam and non-spam, there is no underlying limitation that only two categories be used and thus it may be used for more general purposes as well. (And should perhaps be renamed in a subsequent release.) For example, we might call
$bb->train ({ perl.mbox => PERL,
java.mbox => JAVA,
php.mbox => PHP });
in order to train the classifier to identify other categories of mail.
<<lessSYNOPSIS
use Mail::Classifier::GrahamSpam;
$bb = Mail::Classifier::GrahamSpam->new();
$bb->bias( NOTSPAM, 2);
$bb->train( { spam.mbox => SPAM, notspam.mbox => NOTSPAM } );
my ($cat, $prob) = $bb->score( $msg );
ABSTRACT
Mail::Classifier::GrahamSpam - spam classification based on Paul Grahams algorithm
This class is a specific implementation of a Mail::Classifier that uses Naive Bayesian methods for associating messages with a category. The specific implemenation is based on the article "A Plan for Spam" by Paul Graham (thus the name).
For classic Graham, make sure to set bias on non-spam to 2.
While this class was designed to classify spam and non-spam, there is no underlying limitation that only two categories be used and thus it may be used for more general purposes as well. (And should perhaps be renamed in a subsequent release.) For example, we might call
$bb->train ({ perl.mbox => PERL,
java.mbox => JAVA,
php.mbox => PHP });
in order to train the classifier to identify other categories of mail.
Download (0.13MB)
Added: 2007-08-13 License: Perl Artistic License Price:
803 downloads
Layer-7 Packet Classifier for Linux 2007-07-27 (Pattern Definitions)
Layer-7 Packet Classifier for Linux is a packet classifier for Netfilter that identifies packets based on application layer. more>>
Layer-7 Packet Classifier for Linux is a packet classifier for Netfilter that identifies packets based on application layer (OSI layer 7) data. This means that it is able to classify packets as HTTP, FTP, Gnucleus, Kazaa, etc., regardless of ports.
It complements existing matches that classify based on port numbers, packet length, TOS bits, and so on. Combined with Linux QoS, it allows for full layer 7 packet shaping.
Main features:
- Patches for Linux 2.4 and 2.6
- Support for TCP, UDP and ICMP over IPv4
- Uses Netfilters connection tracking of FTP, IRC, etc
- Examines data across multiple packets
- Number of packets examined tunable on the fly through /proc
- Number of bytes examined tunable at module load time
- Distinguishes between new connections (those still being tested) and old unidentified connections
- Gives access to both Netfilter and QoS (rate limiting) features
- With the Netfilter "helper" match, you can distinguish between parent and child connections (e.g. ftp command/data)
<<lessIt complements existing matches that classify based on port numbers, packet length, TOS bits, and so on. Combined with Linux QoS, it allows for full layer 7 packet shaping.
Main features:
- Patches for Linux 2.4 and 2.6
- Support for TCP, UDP and ICMP over IPv4
- Uses Netfilters connection tracking of FTP, IRC, etc
- Examines data across multiple packets
- Number of packets examined tunable on the fly through /proc
- Number of bytes examined tunable at module load time
- Distinguishes between new connections (those still being tested) and old unidentified connections
- Gives access to both Netfilter and QoS (rate limiting) features
- With the Netfilter "helper" match, you can distinguish between parent and child connections (e.g. ftp command/data)
Download (MB)
Added: 2007-07-30 License: GPL (GNU General Public License) Price:
820 downloads
Other version of Layer-7 Packet Classifier for Linux
License:GPL (GNU General Public License)
License:GPL (GNU General Public License)
Canzoniere 0.2.0
Canzoniere is an Mp3 mood classifier. more>>
Canzoniere is an Mp3 mood classifier.
Canzoniere is an mp3 classification tool, which allows users to classify their songs using personal criteria such as artist score, song score and moods (i.e. romantic, relax, party, etc.). Users can then select their mood and play songs that match.
<<lessCanzoniere is an mp3 classification tool, which allows users to classify their songs using personal criteria such as artist score, song score and moods (i.e. romantic, relax, party, etc.). Users can then select their mood and play songs that match.
Download (0.60MB)
Added: 2005-07-19 License: GPL (GNU General Public License) Price:
1565 downloads
Pattern Classification Program 2.2
Pattern Classification Program is a machine learning program for pattern classification. more>>
Pattern Classification Program is an open-source machine learning program for supervised and unsupervised classification of patterns (vectors of measurements). Pattern Classification Program implements the following algorithms and methods:
- k-means clustering
- Fishers linear discriminant
- dimension reduction using Singular Value Decomposition
- Principal Component Analysis
- feature subset selection
- Bayes error estimation
- parametric classifiers (linear and quadratic)
- least-squares (pseudo-inverse) linear discriminant
- k-Nearest Neighbor
- neural networks (Multi-Layer Perceptron)
- Support Vector Machine algorithm
- cross-validation
- bagging (committee) classification
The program supports interactive and batch processing. Commands are issued through a keyboard-driven menu system in the interactive mode, or in a batch file in the batch mode. It is a binary executable and does not need any special run-time environment. PCP uses tab-delimited text files for input data. The results are displayed on the screen and saved in text files.
PCP runs under Linux and Windows operating systems (under Cygwin environment), on i386 architecture CPUs such as Intel Pentium or AMD Athlon. PCP has been developed and tested on RedHat Linux 9.0 distribution. It has also been tested on SUSE Linux 9.1 and Fedora Core 2 and verified to run on Knoppix 3.7 and Windows XP.
Enhancements:
- This release supports model selection for the linear SVM kernel and an option to build SVD transforms using training and test datasets (as opposed to just training data).
- P-errors are now reported in SVM model selection.
- The build process was simplified.
<<less- k-means clustering
- Fishers linear discriminant
- dimension reduction using Singular Value Decomposition
- Principal Component Analysis
- feature subset selection
- Bayes error estimation
- parametric classifiers (linear and quadratic)
- least-squares (pseudo-inverse) linear discriminant
- k-Nearest Neighbor
- neural networks (Multi-Layer Perceptron)
- Support Vector Machine algorithm
- cross-validation
- bagging (committee) classification
The program supports interactive and batch processing. Commands are issued through a keyboard-driven menu system in the interactive mode, or in a batch file in the batch mode. It is a binary executable and does not need any special run-time environment. PCP uses tab-delimited text files for input data. The results are displayed on the screen and saved in text files.
PCP runs under Linux and Windows operating systems (under Cygwin environment), on i386 architecture CPUs such as Intel Pentium or AMD Athlon. PCP has been developed and tested on RedHat Linux 9.0 distribution. It has also been tested on SUSE Linux 9.1 and Fedora Core 2 and verified to run on Knoppix 3.7 and Windows XP.
Enhancements:
- This release supports model selection for the linear SVM kernel and an option to build SVD transforms using training and test datasets (as opposed to just training data).
- P-errors are now reported in SVM model selection.
- The build process was simplified.
Download (4.3MB)
Added: 2006-05-25 License: BSD License Price:
1253 downloads
knetfilter 3.5.1
knetfilter is a KDE frontend to iptables. more>>
Knetfilter project is a KDE application designed to manage the netfilter functionalities that come with the kernels 2.4 and later.
In Princip, all standard firewall system administration activities can be done just using knetfilter. But there is not just a GUI to iptables comand line, it is possible also some monitoring with tcpdump and nmap (nmap is slow) interfaces.
Now knetfilter is able to save iptables rules indipendently from iptable-save command (that does not work). ALL Chain policies are saved. (knetfilter has been the first GUI/application running with Linux 2.4.X able to save and restore your work on your firewall, at less for what I know)
Since version 2.2.2 knetfilter allows CBQ traffic shaping using fw classifier. Actually a lot of more stuff about QoS support has been developed inside of knetfilter, as, for example, the possibility to delete a class or a qdisc, and a monitor to see which qdiscs, classes and filters have been configured. They are all cool features, but probably a save function will not be developed for now (happy to receive a patch for that).
Version restrictions:
- Iptables 1.2.3 has a noisy bug, so that TOS mangling works just if TOS value is setted using the name and not the numeric value. A workaround is easy, but iptables-save saves TOS related rules using the exadecimal value, so anyway users would not be able to restore them, since iptables would be unable to understand the syntax. Knetfilter uses decimal value to set the TOS, and that is a correct way to do so, but with iptables 1.2.3 this simply does not work! My suggestion for now is to avoid iptables 1.2.3 if you need TOS mangling. Anyway iptables 1.2.3 is a really old version, so why should you use it?
Enhancements:
- Some typos were corrected.
<<lessIn Princip, all standard firewall system administration activities can be done just using knetfilter. But there is not just a GUI to iptables comand line, it is possible also some monitoring with tcpdump and nmap (nmap is slow) interfaces.
Now knetfilter is able to save iptables rules indipendently from iptable-save command (that does not work). ALL Chain policies are saved. (knetfilter has been the first GUI/application running with Linux 2.4.X able to save and restore your work on your firewall, at less for what I know)
Since version 2.2.2 knetfilter allows CBQ traffic shaping using fw classifier. Actually a lot of more stuff about QoS support has been developed inside of knetfilter, as, for example, the possibility to delete a class or a qdisc, and a monitor to see which qdiscs, classes and filters have been configured. They are all cool features, but probably a save function will not be developed for now (happy to receive a patch for that).
Version restrictions:
- Iptables 1.2.3 has a noisy bug, so that TOS mangling works just if TOS value is setted using the name and not the numeric value. A workaround is easy, but iptables-save saves TOS related rules using the exadecimal value, so anyway users would not be able to restore them, since iptables would be unable to understand the syntax. Knetfilter uses decimal value to set the TOS, and that is a correct way to do so, but with iptables 1.2.3 this simply does not work! My suggestion for now is to avoid iptables 1.2.3 if you need TOS mangling. Anyway iptables 1.2.3 is a really old version, so why should you use it?
Enhancements:
- Some typos were corrected.
Download (0.94MB)
Added: 2006-07-27 License: GPL (GNU General Public License) Price:
1184 downloads
Gamera 3.0.1
Gamera is a document-recognition programming framework. more>>
Gamera project is a framework for the creation of structured document analysis applications by domain experts. Domain experts are individuals who have a strong knowledge of the documents in a collection, but may not have a formal technical background.
The goal is to create a tool that leverages their knowledge of the target documents to create custom applications rather than attempting to meet diverse requirements with a monolithic application.
This paper gives an overview of the architecture and design principles of Gamera.
Developing recognition systems for difficult historical documents requires experimentation since the solution is often non-obvious. Therefore, Gameras primary goal is to support an efficient test-and-refine development cycle.
Virtually every implementation detail is driven by this goal. For instance, Python [Rossum2002] was chosen as the core language because of its introspection capabilities, dynamic typing and ease of use. It has been used as a first programming language with considerable success [Berehzny2001].
C++ is used to write plugins where runtime performance is a priority, but even in that case, the Gamera plugin system is designed to make writing extensions as easy as possible. Gamera includes a full-fledged graphical user interface that provides a number of shortcuts for training, as well as inspection of the results of algorithms at every step.
By improving the ease of experimentation, we hope to put the power to develop recognition systems with those who understand the documents best. We expect at least two kinds of developers to work with the system: those with a technical background adding algorithms to the system, and those working on the higher-level aggregation of those pieces. It is important to note this distinction, since those groups represent different skill sets and requirements.
In addition to its support of test-and-refine development, Gamera also has several other advantages that are important to large-scale digitization projects in general. These are:
* Open source code and standards-compliance so that the software can interact well with other parts of a digitization framework
* Platform independence, running on a variety of operating systems including Linux, Microsoft Windows and Mac OS-X
* A workflow system to combine high-level tasks
* Batch processing
* A unit-testing framework to ensure correctness and avoid regression
* User interface components for development and classifier training
* Recognition confidence output so that collection managers can easily target documents that need correction or different recognition strategies.
Gamera has a modular plugin architecture. These modules typically perform one of five document recognition tasks:
1. Pre-processing
2. Document segmentation and analysis
3. Symbol segmentation and classification
4. Syntactical or structural analysis
5. Output
Each of these tasks can be arbitrarily complex, involve multiple strategies or modules, or be removed entirely depending on the specific recognition problem at hand. The actual steps that make up a complete recognition system are completely controlled by the user.
Pre-processing involves standard image-processing operations such as noise removal, blurring, de-skewing, contrast adjustment, sharpening, binarization, and morphology. Close attention to and refinement of these steps is particularly important when working with degraded historical documents.
<<lessThe goal is to create a tool that leverages their knowledge of the target documents to create custom applications rather than attempting to meet diverse requirements with a monolithic application.
This paper gives an overview of the architecture and design principles of Gamera.
Developing recognition systems for difficult historical documents requires experimentation since the solution is often non-obvious. Therefore, Gameras primary goal is to support an efficient test-and-refine development cycle.
Virtually every implementation detail is driven by this goal. For instance, Python [Rossum2002] was chosen as the core language because of its introspection capabilities, dynamic typing and ease of use. It has been used as a first programming language with considerable success [Berehzny2001].
C++ is used to write plugins where runtime performance is a priority, but even in that case, the Gamera plugin system is designed to make writing extensions as easy as possible. Gamera includes a full-fledged graphical user interface that provides a number of shortcuts for training, as well as inspection of the results of algorithms at every step.
By improving the ease of experimentation, we hope to put the power to develop recognition systems with those who understand the documents best. We expect at least two kinds of developers to work with the system: those with a technical background adding algorithms to the system, and those working on the higher-level aggregation of those pieces. It is important to note this distinction, since those groups represent different skill sets and requirements.
In addition to its support of test-and-refine development, Gamera also has several other advantages that are important to large-scale digitization projects in general. These are:
* Open source code and standards-compliance so that the software can interact well with other parts of a digitization framework
* Platform independence, running on a variety of operating systems including Linux, Microsoft Windows and Mac OS-X
* A workflow system to combine high-level tasks
* Batch processing
* A unit-testing framework to ensure correctness and avoid regression
* User interface components for development and classifier training
* Recognition confidence output so that collection managers can easily target documents that need correction or different recognition strategies.
Gamera has a modular plugin architecture. These modules typically perform one of five document recognition tasks:
1. Pre-processing
2. Document segmentation and analysis
3. Symbol segmentation and classification
4. Syntactical or structural analysis
5. Output
Each of these tasks can be arbitrarily complex, involve multiple strategies or modules, or be removed entirely depending on the specific recognition problem at hand. The actual steps that make up a complete recognition system are completely controlled by the user.
Pre-processing involves standard image-processing operations such as noise removal, blurring, de-skewing, contrast adjustment, sharpening, binarization, and morphology. Close attention to and refinement of these steps is particularly important when working with degraded historical documents.
Download (4.8MB)
Added: 2006-06-14 License: GPL (GNU General Public License) Price:
1230 downloads
icsiboost 0.2
icsiboost implements Adaboost over stumps on discrete and continuous attributes. more>>
Boosting is a meta-learning approach that aims at combining an ensemble of weak classifiers to form a strong classifier. Adaptive Boosting (Adaboost) implements this idea as a greedy search for a linear combination of classifiers by overweighting the examples that are misclassified by each classifier.
The icsiboost project implements Adaboost over stumps (one-level decision trees) on discrete and continuous attributes (words and real values). See http://en.wikipedia.org/wiki/AdaBoost and the papers by Y. Freund and R. Schapire for more details. This approach is one of most efficient and simple to combine continuous and nominal values. Our implementation is aimed at allowing training from millions of examples by hundreds of features in a reasonable time/memory.
USAGE: icsiboost [options] -S < stem >
--version print version info
-S < stem > defines model/data/names stem
-n < iterations > number of boosting iterations
-E < smoothing > set smoothing value (default=0.5)
-V verbose mode
-C classification mode -- reads examples from < stdin >
-o long output in classification mode
--cutoff < freq > ignore nominal features occuring unfrequently
--jobs < threads > number of threaded weak learners
--do-not-pack-model do not pack model (to get individual training steps)
--output-weights output training examples weights at each iteration
--model < model > save/load the model to/from this file instead of < stem >.shyp
--train < file > bypass the .data filename to specify training examples
--test < file > output additional error rate from an other file during training (can be used multiple times, not implemented)
<<lessThe icsiboost project implements Adaboost over stumps (one-level decision trees) on discrete and continuous attributes (words and real values). See http://en.wikipedia.org/wiki/AdaBoost and the papers by Y. Freund and R. Schapire for more details. This approach is one of most efficient and simple to combine continuous and nominal values. Our implementation is aimed at allowing training from millions of examples by hundreds of features in a reasonable time/memory.
USAGE: icsiboost [options] -S < stem >
--version print version info
-S < stem > defines model/data/names stem
-n < iterations > number of boosting iterations
-E < smoothing > set smoothing value (default=0.5)
-V verbose mode
-C classification mode -- reads examples from < stdin >
-o long output in classification mode
--cutoff < freq > ignore nominal features occuring unfrequently
--jobs < threads > number of threaded weak learners
--do-not-pack-model do not pack model (to get individual training steps)
--output-weights output training examples weights at each iteration
--model < model > save/load the model to/from this file instead of < stem >.shyp
--train < file > bypass the .data filename to specify training examples
--test < file > output additional error rate from an other file during training (can be used multiple times, not implemented)
Download (0.10MB)
Added: 2007-07-26 License: GPL (GNU General Public License) Price:
826 downloads
Bayesian Noise Reduction Library 2.0.3
Bayesian Noise Reduction Library is an implementation of the Bayesian Noise Reduction algorithm. more>>
libbnr is an implementation of the Bayesian Noise Reduction (BNR) algorithm. All samples of text contain some degree of noise (data which is either intentionally or unintentionally irrelevant to accurate statistical analysis of the sample where removal of the data would result in a cleaner analysis).
The Bayesian noise reduction algorithm provides a means of cleaner machine learning by providing more useful data, which ultimately leads to better sample analysis. With the noisy data removed from the sample, what is left is only data relevant to the classification. libbnr can be linked in with your classifier and called using the standard C interface.
<<lessThe Bayesian noise reduction algorithm provides a means of cleaner machine learning by providing more useful data, which ultimately leads to better sample analysis. With the noisy data removed from the sample, what is left is only data relevant to the classification. libbnr can be linked in with your classifier and called using the standard C interface.
Download (0.28MB)
Added: 2005-04-19 License: GPL (GNU General Public License) Price:
924 downloads
LTI-Lib 1.9.15
LTI-Lib is a C++ Library for computer vision. more>>
The LTI-Lib is an object oriented library with algorithms and data structures frequently used in image processing and computer vision.
LTI-Lib has been developed at the Chair of Technical Computer Science (Lehrstuhl fuer Technische Informatik) LTI at the Aachen University of Technology, as part of many research projects in computer vision dealing with robotics, object recognition and sin
The main goal of the LTI-Lib is to provide an object oriented library in C++, which simplifies the code sharing and maintenance, but still providing fast algorithms that can be used in real applications.
It has been developed using GCC under Linux, and Visual C++ under Windows NT. We have not tested it under other platforms.
Many classes encapsulate Windows/Linux functionality in order to simplify dealing with system or hardware specific code (for example classes for multi-threading and synchronization, time measurement and serial port access).
The rest of the more than 300 classes deal mainly with one of following fields:
Linear algebra
Matrices, Vectors, Tensors, and functors to extract eigenvalues, eigenvectors, linear equations solutions, statistics, etc. are provided.
Classification and Clustering
Radial Basis Function classifiers, Support Vector Machines, k-Means, Fuzzy C-Means, classification statistics are just some examples of what you can do with the LTI-Lib.
Image Processing
The most classes deal with image processing problems. Different segmentation approaches, linear filters, wavelets, steerable filters, und much more are already available.
Visualization and Drawing Tools
The most difficult part when developing image processing algorithms in C++ is showing temporary images while debugging. Due to the object oriented architecture of the LTI-Lib, you just need to create a viewer object and give it the image you need to show. Thats it. An if you additionally need to draw some extra information on that image (some text, ellipses, boxes, lines or points) you can use one of the drawing objects. This will help you to save lots of time!
<<lessLTI-Lib has been developed at the Chair of Technical Computer Science (Lehrstuhl fuer Technische Informatik) LTI at the Aachen University of Technology, as part of many research projects in computer vision dealing with robotics, object recognition and sin
The main goal of the LTI-Lib is to provide an object oriented library in C++, which simplifies the code sharing and maintenance, but still providing fast algorithms that can be used in real applications.
It has been developed using GCC under Linux, and Visual C++ under Windows NT. We have not tested it under other platforms.
Many classes encapsulate Windows/Linux functionality in order to simplify dealing with system or hardware specific code (for example classes for multi-threading and synchronization, time measurement and serial port access).
The rest of the more than 300 classes deal mainly with one of following fields:
Linear algebra
Matrices, Vectors, Tensors, and functors to extract eigenvalues, eigenvectors, linear equations solutions, statistics, etc. are provided.
Classification and Clustering
Radial Basis Function classifiers, Support Vector Machines, k-Means, Fuzzy C-Means, classification statistics are just some examples of what you can do with the LTI-Lib.
Image Processing
The most classes deal with image processing problems. Different segmentation approaches, linear filters, wavelets, steerable filters, und much more are already available.
Visualization and Drawing Tools
The most difficult part when developing image processing algorithms in C++ is showing temporary images while debugging. Due to the object oriented architecture of the LTI-Lib, you just need to create a viewer object and give it the image you need to show. Thats it. An if you additionally need to draw some extra information on that image (some text, ellipses, boxes, lines or points) you can use one of the drawing objects. This will help you to save lots of time!
Download (3.3MB)
Added: 2005-11-29 License: LGPL (GNU Lesser General Public License) Price:
1428 downloads
Linux QoS Library 0.8.0
Linux QoS Library is a C API for the network QoS features of the Linux kernel. more>>
The Linux QoS Library (LQL) provides a GPL licensed, GObject based C API to manipulate the network queueing disciplines, classes and classifiers in the Linux kernel.
LQL does not use the TC command as a back-end. Instead, LQL communicates with the Linux kernel via Netlink sockets the same way TC does.
At the present time, LQL implements a subset of the Linux network QoS features exposed by the TC command.
Hopefully, this will change as the library matures.
In an ideal world TC would be implemented with a high(er) level API like LQL so that new kernel network QoS features would be immediately available to third party applications using the high level library.
Who knows what interesting innovations would have been created around the Linux network QoS features over the last few years if there was an easier API to manipulate them. LQL is an attempt to fill this need.
Queueing disciplines currently supported by LQL:
HTB
PFIFO
SFQ
PFIFOFast
Priomap
DSMark
Netem
Classifiers currently supported by LQL:
U32
Fwmark
TCIndex
<<lessLQL does not use the TC command as a back-end. Instead, LQL communicates with the Linux kernel via Netlink sockets the same way TC does.
At the present time, LQL implements a subset of the Linux network QoS features exposed by the TC command.
Hopefully, this will change as the library matures.
In an ideal world TC would be implemented with a high(er) level API like LQL so that new kernel network QoS features would be immediately available to third party applications using the high level library.
Who knows what interesting innovations would have been created around the Linux network QoS features over the last few years if there was an easier API to manipulate them. LQL is an attempt to fill this need.
Queueing disciplines currently supported by LQL:
HTB
PFIFO
SFQ
PFIFOFast
Priomap
DSMark
Netem
Classifiers currently supported by LQL:
U32
Fwmark
TCIndex
Download (0.45MB)
Added: 2005-10-28 License: GPL (GNU General Public License) Price:
1460 downloads
AgileWiki 3.5.0.12
AgileWiki is a Java-based wiki that provides a virtual wiki for each registered user, complete with access control. more>>
AgileWiki is a Java-based wiki that provides a virtual wiki for each registered user, complete with access control and versioning.
The backend includes a built-in database (which uses flat files) and communicates via RMI to either a Servlet (packaged as a WAR file) or to a Swing client. AgileWiki is also both an application platform and a knowledge management system.
The goal is to build an extensible wiki application server based on Rolonics, which is a theory of knowledge developed by Norman Kashdan. Ths work has been on-going for about 6 years now, and open source for the last two.
Prior versions were implemented in Python, the switch to Java being driven by a need for a faster database. (A custom OODBMS has already been developed in Java. It supports 50K/sec inserts and handles nested transactions at the rate of 500/sec.)
At present, Swing, text and Servlet clients have been implemented, with all communication with the application server via XML over RMI. Both the Swing client and web access support a Wiki and a Rolonic interface.
AgileWiki supports virtual wikis, each user having their own space, full access control and the ability to delegate access through the definition of user groups.
This project self-hosts its own documentation, includes support for installing and deploying application code, offers some agility for managing content and provides transactional support for table updates as well.
The next phase of the project is to work on classifiers (half a dozen different kinds) which are used to customize the namespace for each Rolon (node). The deep knowledge structures supported by the AgileWiki database make use of late binding, with the namespace of each Rolon used to resolve references to other nodes.
Enhancements:
- Wiki text is now automaticly updated by refactoring operations.
<<lessThe backend includes a built-in database (which uses flat files) and communicates via RMI to either a Servlet (packaged as a WAR file) or to a Swing client. AgileWiki is also both an application platform and a knowledge management system.
The goal is to build an extensible wiki application server based on Rolonics, which is a theory of knowledge developed by Norman Kashdan. Ths work has been on-going for about 6 years now, and open source for the last two.
Prior versions were implemented in Python, the switch to Java being driven by a need for a faster database. (A custom OODBMS has already been developed in Java. It supports 50K/sec inserts and handles nested transactions at the rate of 500/sec.)
At present, Swing, text and Servlet clients have been implemented, with all communication with the application server via XML over RMI. Both the Swing client and web access support a Wiki and a Rolonic interface.
AgileWiki supports virtual wikis, each user having their own space, full access control and the ability to delegate access through the definition of user groups.
This project self-hosts its own documentation, includes support for installing and deploying application code, offers some agility for managing content and provides transactional support for table updates as well.
The next phase of the project is to work on classifiers (half a dozen different kinds) which are used to customize the namespace for each Rolon (node). The deep knowledge structures supported by the AgileWiki database make use of late binding, with the namespace of each Rolon used to resolve references to other nodes.
Enhancements:
- Wiki text is now automaticly updated by refactoring operations.
Download (2.5MB)
Added: 2006-11-04 License: Common Public License Price:
1084 downloads
Traffic Control Super Script 5.1-1-devel
Traffic Control Super Script can manage bandwidth to user-specified speeds based on the u32 classifier. more>>
Traffic Control Super Script implements traffic shaping for IP traffic passing through a NAT/bridge box with a single configuration file with one line per host.
Traffic Control Super Script can manage bandwidth to user-specified speeds based on the u32 classifier, and can identify traffic by source, destination, source and destination port, protocol, and ToS field. It then limits the rate of connection in either a single or a bidirectional fashion.
Enhancements:
- This release adds multiple interface support.
- It adds an option to choose between flat file and MySQL rules databases.
- It fixes bug #1469742 (duplicate group breaking child / parent relationships when direction=bi on group definitions).
- Various minor bugs have been fixed.
- There are major code cleanups, and major documentation updates on the Web site.
<<lessTraffic Control Super Script can manage bandwidth to user-specified speeds based on the u32 classifier, and can identify traffic by source, destination, source and destination port, protocol, and ToS field. It then limits the rate of connection in either a single or a bidirectional fashion.
Enhancements:
- This release adds multiple interface support.
- It adds an option to choose between flat file and MySQL rules databases.
- It fixes bug #1469742 (duplicate group breaking child / parent relationships when direction=bi on group definitions).
- Various minor bugs have been fixed.
- There are major code cleanups, and major documentation updates on the Web site.
Download (0.040MB)
Added: 2006-04-13 License: GPL (GNU General Public License) Price:
748 downloads
dbacl 1.12
dbacl is a digramic Bayesian text classifier. more>>
dbacl is a digramic Bayesian text classifier. Given some text, it calculates the posterior probabilities that the input resembles one of any number of previously learned document collections.
dbacl project can be used to sort incoming email into arbitrary categories such as spam, work, and play, or simply to distinguish an English text from a French text.
It fully supports international character sets, and uses sophisticated statistical models based on the Maximum Entropy Principle.
The dbacl project includes a tutorial or two, and a mathematical design paper (.ps.gz). Alternatively, browse the online manual pages for dbacl, bayesol, mailcross, mailtoe, mailfoot, mailinspect.
I have found two uses for dbacl so far:
- As an automated Bayesian email classification tool, it can recognize spam, and more generally sort incoming email into any number of categories such as work, play, etc.
- As a noise filter, it is useful during the indexing of personal document collections.
Both dbacl and its companion programs are written in C and run on UNIX/POSIX.
Enhancements:
- This is a hodge-podge of fixes and improvements.
- A new hypex command, the TREC 2005 options files, and an essay on chess are now in the tarball.
- Several improvements to the parsing engine were made, including a new -e char option and bugfixes.
- Compilation problems on various architectures were fixed, and libslang2 support was added.
<<lessdbacl project can be used to sort incoming email into arbitrary categories such as spam, work, and play, or simply to distinguish an English text from a French text.
It fully supports international character sets, and uses sophisticated statistical models based on the Maximum Entropy Principle.
The dbacl project includes a tutorial or two, and a mathematical design paper (.ps.gz). Alternatively, browse the online manual pages for dbacl, bayesol, mailcross, mailtoe, mailfoot, mailinspect.
I have found two uses for dbacl so far:
- As an automated Bayesian email classification tool, it can recognize spam, and more generally sort incoming email into any number of categories such as work, play, etc.
- As a noise filter, it is useful during the indexing of personal document collections.
Both dbacl and its companion programs are written in C and run on UNIX/POSIX.
Enhancements:
- This is a hodge-podge of fixes and improvements.
- A new hypex command, the TREC 2005 options files, and an essay on chess are now in the tarball.
- Several improvements to the parsing engine were made, including a new -e char option and bugfixes.
- Compilation problems on various architectures were fixed, and libslang2 support was added.
Download (0.75MB)
Added: 2006-03-26 License: GPL (GNU General Public License) Price:
1307 downloads
MACTS 1.01
MACTS is a traffic shaper which uses MAC addresses which are associated with users to classify traffic. more>>
MACTS project is a traffic shaper that uses MAC addresses which are associated with users to classify traffic.
This allows fair usage of bandwidth among many machines. Additionally, there is a statistics monitor which displays current statistics on the terminal or stores them in round robin databases.
The stored data may then be used to generate graphs with the included Perl/CGI scripts. The configuration file is straight-forward and requires little knowledge of networking or the underlying traffic control mechanism. Setup should be easy.
Components:
macts - This clears the current traffic classifiers and sets up new ones, as directed by /etc/macts/macts.conf. It also stores some temporary state data in /etc/macts/handles.cache.
macts-stats - With no args, this displays statistics on a terminal, including data rate (kb/s), packet rate (packets/s), and backlog (packets) for each machine. Given the -r flag, it stores the statistics in round robin databases (one for each machine), located in /etc/macts/stats/.
macts-chart - This is a CLI chart generator which reads data from RRDs stored in /etc/macts/stats/.
macts-chart.cgi - This is a CGI wrapper for macts-chart.
Installation:
- mkdir /etc/macts
- mkdir /etc/macts/stats
- create /etc/macts/macts.conf
- add the following lines to /etc/sysctl.conf:
net.ipv4.conf.default.accept_source_route = 1 # is this necessary?
net.bridge.bridge-nf-filter-vlan-tagged = 0
net.bridge.bridge-nf-call-ip6tables = 0
net.bridge.bridge-nf-call-iptables = 0
net.bridge.bridge-nf-call-arptables = 0
- move macts, macts-stats, and macts-chart to /usr/local/bin/.
- (optional) install rrdtools and the perl rrdtool interface
- (optional) add the following line to roots cron:
*/5 * * * * /usr/local/bin/macts-stats -r 2&> /dev/null
- (optional) move macts-chart.cgi to your web servers cgi directory.
Enhancements:
- Installation instructions have been fixed.
<<lessThis allows fair usage of bandwidth among many machines. Additionally, there is a statistics monitor which displays current statistics on the terminal or stores them in round robin databases.
The stored data may then be used to generate graphs with the included Perl/CGI scripts. The configuration file is straight-forward and requires little knowledge of networking or the underlying traffic control mechanism. Setup should be easy.
Components:
macts - This clears the current traffic classifiers and sets up new ones, as directed by /etc/macts/macts.conf. It also stores some temporary state data in /etc/macts/handles.cache.
macts-stats - With no args, this displays statistics on a terminal, including data rate (kb/s), packet rate (packets/s), and backlog (packets) for each machine. Given the -r flag, it stores the statistics in round robin databases (one for each machine), located in /etc/macts/stats/.
macts-chart - This is a CLI chart generator which reads data from RRDs stored in /etc/macts/stats/.
macts-chart.cgi - This is a CGI wrapper for macts-chart.
Installation:
- mkdir /etc/macts
- mkdir /etc/macts/stats
- create /etc/macts/macts.conf
- add the following lines to /etc/sysctl.conf:
net.ipv4.conf.default.accept_source_route = 1 # is this necessary?
net.bridge.bridge-nf-filter-vlan-tagged = 0
net.bridge.bridge-nf-call-ip6tables = 0
net.bridge.bridge-nf-call-iptables = 0
net.bridge.bridge-nf-call-arptables = 0
- move macts, macts-stats, and macts-chart to /usr/local/bin/.
- (optional) install rrdtools and the perl rrdtool interface
- (optional) add the following line to roots cron:
*/5 * * * * /usr/local/bin/macts-stats -r 2&> /dev/null
- (optional) move macts-chart.cgi to your web servers cgi directory.
Enhancements:
- Installation instructions have been fixed.
Download (0.014MB)
Added: 2006-02-25 License: GPL (GNU General Public License) Price:
1337 downloads
Secleted [ 0 ] software to compare
- Page: 1 of 2
- 1
- 2
Copyright Notice:
Software piracy is theft, Using crack, password, serial numbers, registration codes, key generators is illegal and prevent future software development. The above classifier search only lists software in full, demo and trial versions for free download. Download links are directly from our mirror sites or publisher sites, torrent files or links from rapidshare.com, yousendit.com or megaupload.com are not allowed