add entropy data
video-entropyd 0.8
video-entropyd is a program to add entropy data from video4linux devices to the kernel random driver. more>>
For security reasons (when doing network traffic or generating secure keys for example) one wants as much entropy-data in the kernel random-driver as possible. The random-driver takes partially care for this. But in situations in where theres a lot of demand for entropy-data, it might not be able to gather enough entropy-data by itself.
Thats where this program is for: adding entropy-data to the kernel-driver. It does that by fetching 2 images from a video4linux-device (with a random delay in between), calculating the difference between those two and then calculating the number of information-bits in that data. After that, the data with the number-of-entropy-bits is submitted to the kernel-random-driver.
After that, the program exits (when run from crontab) or sleeps a random time before redoing the same process.
Enhancements:
- This version checks the quality of the data it feeds to the /dev/random-device to see if the data is really random.
- Extra logging has been added.
Add to Noatun playlist
Add to Noatun playlist is a service menu that can add files to the Noatun players playlist. more>>
Entropy RSA 0.9.1-439
Entropy RSA is a a faster and more sophisticated replacement for Freenet. more>>
Main features:
- ENTROPY is developed as a response to increasing censorship and surveillance in the internet. The program connects your computer to a network of machines which all run this software. The ENTROPY network is running parallel to the WWW and also other internet services like FTP, email, ICQ. etc.
- For the user the ENTROPY network looks like a collection of WWW pages. The difference to the WWW however is that there are no accesses to central servers. And this is why there is no site operator who could log who downloaded what and when. Every computer taking part in the ENTROPY network (every node) is at the same time server, router for other nodes, caching proxy and client for the user: that is You.
- After you gained some experience with the ENTROPY network, there are command line tools for you to insert whole directory trees into the network as a ENTROPY site. So ENTROPY does for you what a webspace provider does for you in the WWW - but without the storage and bandwidth costs and without any regulation or policy as to what kind of content you are allowed to publish. Everyone can contribute his own ENTROPY site for everybody else to browse through. The contents is stored in a distributed manner across all available and reachable nodes and no one can find out about who put up what contents into the network. Even if your node is not actively running, your contents can be retrieved by others -- without knowing that it was actually you who published the files. Of course this is only true if you do not publish your name (or leave your name or other personal data in the files you publish)
Enhancements:
- Bugfixes were made.
- This release is not backwards compatible.
Statistics::MaxEntropy 0.9
MaxEntropy is a Perl5 module for Maximum Entropy Modeling and Feature Induction. more>>
SYNOPSIS
use Statistics::MaxEntropy;
# debugging messages; default 0
$Statistics::MaxEntropy::debug = 0;
# maximum number of iterations for IIS; default 100
$Statistics::MaxEntropy::NEWTON_max_it = 100;
# minimal distance between new and old x for Newtons method;
# default 0.001
$Statistics::MaxEntropy::NEWTON_min = 0.001;
# maximum number of iterations for Newtons method; default 100
$Statistics::MaxEntropy::KL_max_it = 100;
# minimal distance between new and old x; default 0.001
$Statistics::MaxEntropy::KL_min = 0.001;
# the size of Monte Carlo samples; default 1000
$Statistics::MaxEntropy::SAMPLE_size = 1000;
# creation of a new event space from an events file
$events = Statistics::MaxEntropy::new($file);
# Generalised Iterative Scaling, "corpus" means no sampling
$events->scale("corpus", "gis");
# Improved Iterative Scaling, "mc" means Monte Carlo sampling
$events->scale("mc", "iis");
# Feature Induction algorithm, also see Statistics::Candidates POD
$candidates = Statistics::Candidates->new($candidates_file);
$events->fi("iis", $candidates, $nr_to_add, "mc");
# writing new events, candidates, and parameters files
$events->write($some_other_file);
$events->write_parameters($file);
$events->write_parameters_with_names($file);
# dump/undump the event space to/from a file
$events->dump($file);
$events->undump($file);
This module is an implementation of the Generalised and Improved Iterative Scaling (GIS, IIS) algorithms and the Feature Induction (FI) algorithm as defined in (Darroch and Ratcliff 1972) and (Della Pietra et al. 1997). The purpose of the scaling algorithms is to find the maximum entropy distribution given a set of events and (optionally) an initial distribution.
Also a set of candidate features may be specified; then the FI algorithm may be applied to find and add the candidate feature(s) that give the largest `gain in terms of Kullback Leibler divergence when it is added to the current set of features.
Events are specified in terms of a set of feature functions (properties) f_1...f_k that map each event to {0,1}: an event is a string of bits. In addition of each event its frequency is given. We assume the event space to have a probability distribution that can be described by
The module requires the Bit::SparseVector module by Steffen Beyer and the Data::Dumper module by Gurusamy Sarathy. Both can be obtained from CPAN just like this module.
desktop-data-manager 0.8.10
desktop-data-manager includes a clipboard history for many different types of content (text, images, ...). more>>
The two applications are designed to work well together. For more details please visit my homepage.
Notes: If you find some bugs/problems with the application please contact me at einki(at)users.sourceforge.net. The Program is programmed to work in a GTK/GNOME environment but at least the basic functionalities will work in KDE too.
Add Podcast to amaroK 1.0
Add Podcast to amaroK is a script that allow you to add Podcasts to amaroK with just 3 clicks. more>>
The item is adding the selected URL to amaroKs Podcast database.
Note that the script is not very dynamic. It will not be able to recognize PHP based Podcasts if its not having the correct mimetype (RDF/RSS/XML).
AI::DecisionTree 0.08
AI::DecisionTree is Perl module for automatically Learns Decision Trees. more>>
SYNOPSIS
use AI::DecisionTree;
my $dtree = new AI::DecisionTree;
# A set of training data for deciding whether to play tennis
$dtree->add_instance
(attributes => {outlook => sunny,
temperature => hot,
humidity => high},
result => no);
$dtree->add_instance
(attributes => {outlook => overcast,
temperature => hot,
humidity => normal},
result => yes);
... repeat for several more instances, then:
$dtree->train;
# Find results for unseen instances
my $result = $dtree->get_result
(attributes => {outlook => sunny,
temperature => hot,
humidity => normal});
The AI::DecisionTree module automatically creates so-called "decision trees" to explain a set of training data. A decision tree is a kind of categorizer that use a flowchart-like process for categorizing new instances. For instance, a learned decision tree might look like the following, which classifies for the concept "play tennis":
OUTLOOK
/ |
/ |
/ |
sunny/ overcast rainy
/ |
HUMIDITY | WIND
/ *no* /
/ /
high/ normal /
/ strong/ weak
*no* *yes* /
*no* *yes*
(This example, and the inspiration for the AI::DecisionTree module, come directly from Tom Mitchells excellent book "Machine Learning", available from McGraw Hill.)
A decision tree like this one can be learned from training data, and then applied to previously unseen data to obtain results that are consistent with the training data.
The usual goal of a decision tree is to somehow encapsulate the training data in the smallest possible tree. This is motivated by an "Occams Razor" philosophy, in which the simplest possible explanation for a set of phenomena should be preferred over other explanations. Also, small trees will make decisions faster than large trees, and they are much easier for a human to look at and understand. One of the biggest reasons for using a decision tree instead of many other machine learning techniques is that a decision tree is a much more scrutable decision maker than, say, a neural network.
The current implementation of this module uses an extremely simple method for creating the decision tree based on the training instances. It uses an Information Gain metric (based on expected reduction in entropy) to select the "most informative" attribute at each node in the tree. This is essentially the ID3 algorithm, developed by J. R. Quinlan in 1986. The idea is that the attribute with the highest Information Gain will (probably) be the best attribute to split the tree on at each point if were interested in making small trees.
MIDI Data Miner 3
MIDI Data Miner uses a neural network to learn correlations between notes and control changes in a MIDI file. more>>
After training MDM can augment a live MIDI stream, adding control changes based on notes received.
Briefly: use MDM by connecting a MIDI device, open preferences and set MIDI input and output ports. Open a MIDI file, create a new neural net and train. Now play notes on your MIDI device, MDM will automatically add control changes.
MDM creates a collection of note and controller pairs from the file and uses them to train a net. The notes are used as inputs and the controls as outputs. The window is the number of previous notes considered when determining the output for the current note. Larger windows give less predictable more interesting responses. Enter a number in the window box and press enter to set the window size.
This is an early alpha release, buggy and incomplete. Please send feedback! Note that this alpha version only reads from the first track in a MIDI file, and only uses the first controller. Look at the included MIDI file in the working/midi folder for details.
Add-ons Sidebar 0.2.1.1
Add-ons Sidebar is a Firefox extension that lets you view your Add-ons in the sidebar by pressing Ctrl+Shift+E. more>>
Small and simple extension: only 2 KB!
Only works in development builds with the new Add-ons Manager!
Dont install this if you have Firefox 1.5.0.x or lower.
DOG Data Organizer 0.4.2
DOG Data Organizer provides a bookmark organizer for various bookmark types. more>>
DOG is a personal knowledge manager based on topic maps. It currently specializes in managing bookmarks.
It imports and exports Netscape, Mozilla, and KDE2 (XBEL) bookmark files, and it imports KDE1 bookmarks and Windows IE Favorites.

Unicode Data Browser 1.5
UnicodeDataBrowser is a very useful browser designed for the UnicodeData.txt file which consists of much useful information but is not easily read by humans. more>>
UnicodeDataBrowser 1.5 is a very useful browser designed for the UnicodeData.txt file which consists of much useful information but is not easily read by humans. The browser creates a scrollable table in which columns represent properties.
The table may be sorted on any column. Abbreviations are expanded and characters cross-referenced in decomposition and casing fields are named. Regular expression search restricted to a selected column is available. The set of characters for which information is displayed may be restricted to those characters matching a regular expression on a specified property.
Each such filtering operation applies to the output of the previous filtering operation unless the table is reset to the original full set of characters, so filtering on multiple properties is possible.
Enhancements: Adds canonical decomposition info for Hangul syllables.
<<lessSecure Data Manager 2.1.0
Secure Data Manager is a manager for passwords and other private data. more>>
Secure Data Manager (SDM) is a full-featured password manager application written entirely in Java (so it can run on Unix or Windows). It encrypts logins and other private information for Web sites, computers, credit cards, etc.
Main features:
- Many great features and more coming each month based on user feedback!
- No limit to how you use the product or how often!
- Trusted since you and everyone else can see the code that protects your passwords -- keeping the application clear of any trojans or bad business practices.
- Open source -- so if you know how to write code, you can add any feature you want!
- Free.
Google::Adwords::Data 0.6.0
Google::Adwords::Data is base class for the Data modules. more>>
This module is not supposed to be used directly. Use the child data modules.
Test::Data 1.20
Test::Data is a Perl module to test functions for particular variable types. more>>
SYNOPSIS
use Test::Data qw(Scalar Array Hash Function);
Test::Data provides utility functions to check properties and values of data and variables.
Functions
Plug-in modules define functions for each data type. See the appropriate module.
How it works
The Test::Data module simply emports functions from Test::Data::* modules. Each module defines a self-contained function, and puts that function name into @EXPORT. Test::Data defines its own import function, but that does not matter to the plug-in modules.
If you want to write a plug-in module, follow the example of one that already exists. Name the module Test::Data::Foo, where you replace Foo with the right name. Test::Data should automatically find it.
File::Data 1.12
File::Data is a Perl module as a interface to file data. more>>
Wraps all the accessing of a file into a convenient set of calls for reading and writing data, including a simple regex interface.
Note that the file needs to exist prior to using this module!
See new()
SYNOPSIS
use strict;
use File::Data;
my $o_dat = File::Data->new(./t/example);
$o_dat->write("complete file contentsn");
$o_dat->prepend("first linen"); # line 0
$o_dat->append("original second (last) linen");
$o_dat->insert(2, "new second linen"); # inc. zero!
$o_dat->replace(line, LINE);
print $o_dat->READ;
Or, perhaps more seriously :-}
my $o_sgm = File::Data->new(./sgmlfile);
print "new SGML data: ".$o_sgm->REPLACE(
s*((?s).*)s* ,
qq| key="val" |,
) if $o_sgm;
See METHODS and EXAMPLES.
IMPORTANT
lowercase method calls return the object itself, so you can chain calls.
my $o_obj = $o_dat->read; # ! READ; # !<<less