Free seducing mr perfect software for linux

C Minimal Perfect Hashing Library encapsulates the newest and more efficient algorithms in an easy-to-use, production-quality, fast API. The library was designed to work with big entries that cannot fit in the main memory. It has been used successfully for constructing minimal perfect hash functions for sets with more than 100 million of keys, and we intend to expand this number to the order of billion of keys.
Main features:
- Fast.
- Space-efficient with main memory usage carefully documented.
- The best modern algorithms are available (or at least scheduled for implementation :-)).
- Works with in-disk key sets through of using the adapter pattern.
- Serialization of hash functions.
- Portable C code (currently works on GNU/Linux and WIN32 and is reported to work in OpenBSD and Solaris).
- Object oriented implementation.
- Easily extensible.
- Well encapsulated API aiming binary compatibility through releases.
- Free Software.
A perfect hash function maps a static set of n keys into a set of m integer numbers without collisions, where m is greater than or equal to n. If m is equal to n, the function is called minimal.
Minimal perfect hash functions are widely used for memory efficient storage and fast retrieval of items from static sets, such as words in natural languages, reserved words in programming languages or interactive systems, universal resource locations (URLs) in Web search engines, or item sets in data mining techniques. Therefore, there are applications for minimal perfect hash functions in information retrieval systems, database systems, language translation systems, electronic commerce systems, compilers, operating systems, among others.
The use of minimal perfect hash functions is, until now, restricted to scenarios where the set of keys being hashed is small, because of the limitations of current algorithms. But in many cases, to deal with huge set of keys is crucial. So, this project gives to the free software community an API that will work with sets in the order of billion of keys.
Probably, the most interesting application for minimal perfect hash functions is its use as an indexing structure for databases. The most popular data structure used as an indexing structure in databases is the B+ tree. In fact, the B+ tree is very used for dynamic applications with frequent insertions and deletions of records. However, for applications with sporadic modifications and a huge number of queries the B+ tree is not the best option, because practical deployments of this structure are extremely complex, and perform poorly with very large sets of keys such as those required for the new frontiers database applications.
For example, in the information retrieval field, the work with huge collections is a daily task. The simple assignment of ids to web pages of a collection can be a challenging task. While traditional databases simply cannot handle more traffic once the working set of web page urls does not fit in main memory anymore, minimal perfect hash functions can easily scale to hundred of millions of entries, using stock hardware.
As there are lots of applications for minimal perfect hash functions, it is important to implement memory and time efficient algorithms for constructing such functions. The lack of similar libraries in the free software world has been the main motivation to create the C Minimal Perfect Hashing Library (gperf is a bit different, since it was conceived to create very fast perfect hash functions for small sets of keys and CMPH Library was conceived to create minimal perfect hash functions for very large sets of keys). C Minimal Perfect Hashing Library is a portable LGPLed library to generate and to work with very efficient minimal perfect hash functions.
Enhancements:
- This release adds an implementation of a classical minimal perfect hash algorithm called fch.
- This is used as a basis for a new algorithm that can create minimal perfect hashes for billions of keys with less than four bits per key, and is ready to use.
- Suggestions and bugfixes from users have been incorporated.

Segm program for segmentation of MR images of the brain.

Segm is a set of image analysis tools developed at and used by the Brain Behavior Laboratory of the University of Pennsylvania. It consists of a set of programs (BrainMask, Kmean_3Dseg, and AdpKmean_3Dseg_Ebeta) originally developed by Michelle Yan for use with specific MR imaging protocols used at the Brain Behavior Lab.

They are intended for the quantitative analysis of MRI volume images of the human brain, and particularly for automatic segmentation into tissue types. While these programs have shown themselves very effective for the particular MR imaging protocols they were designed for, they have not proven adaptable to other imaging protocols. Thus, while they continue to be heavily used at BBL for image analysis, they are not recommended for new applications. We do not anticipate making any further changes to segm, except perhaps to fix crippling bugs or to support data interchange with newer and more portable programs.

BBLimage is BBLs newer toolkit for MR image and may be of interest to users of segm; it is, in any case, often preferable to segm for new applications.

Image files are always read and written in big-endian order, regardless of the native architecture; this was done because most or all of the image files at BBL have been generated and stored on the Sparc workstation, and it seemed easier to have programs on all other
platforms read and write this format than to be constantly converting data files.

Installation:

Segm has been sucessfully compiled and run under Red Hat Linux 6.2 for Intel and Solaris 2.7 for Sparc. (The current version requires the gcc compiler, mostly because we havent had the time to figure out exactly how to compile shared library under Suns cc compiler.) We will be interested to hear about other successes or failures, and very interested to receive fixes that will yield success on other machines and operating systems.

If you are installing both BBLimage and segm, you should install segm first, then BBLimage; there are a few installed files that are shared between these two packages, and BBLimage is most likely to have the most recent version.

The following steps will usually suffice:

1. Unpack the tar file and cd into the source tree.

2. Run "./configure" to guess the right parameters for your machine.

By default, `make install will install the packages files in `/usr/local/bin, `/usr/local/man, and `/usr/local/lib. You can specify an installation prefix other than `/usr/local by giving `configure the option `--prefix=PATH. For example, use

./configure --prefix=/home/hughett

to install the programs in /home/hughett/bin, the man pages in /home/hughett/man, and the shared library in /home/hughett/lib/

3. Run "make" to compile and link everything.

4. If youre a programmer, run "make tags" to create the TAGS file for emacs; if youre a vi partisan, make the obvious change to the Makefile first.

5. As root, run "make install" to install all the executable binaries and man pages, typically in /usr/local/bin and /usr/local/man. (The macro PREFIX in the Makefile controls where the files are installed; you might want to look at this to insure that configure has guessed correctly.)

6. You may also need to modify the search paths for binaries and man pages (usually PATH and MANPATH).

7. The shared library libsegm.so is installed in $PREFIX/lib; you may need to add this directory to the search path (usually LD_LIBRARY_PATH) for shared libraries.

ScatterChat is a HACKTIVIST WEAPON designed to allow non-technical human rights activists and political dissidents to communicate securely and anonymously while operating in hostile territory. ScatterChat is also useful in corporate settings, or in other situations where privacy is desired.

It is a secure instant messaging client (based upon the Gaim software) that provides end-to-end encryption, integrated onion-routing with Tor, secure file transfers, and easy-to-read documentation.

Its security features include resiliency against partial compromise through perfect forward secrecy, immunity from replay attacks, and limited resistance to traffic analysis... all reinforced through a pro-actively secure design.

The Ur-Quan Masters is a port of the 3DO version of the classic space game StarControl II.

The game is currently fully playable, though it crashes or locks every now and then. The play experience is also far from perfect; many graphical and control glitches remain to be fixed.

That said, its possible to get all the way to the final battle if you save often to protect against the occasional crash.

Created by accident, all who find you would destroy you. Can you escape?
Endgame: Singularity project is a simulation of a true AI. Go from computer to computer, pursued by the entire world. Keep hidden, and you might have a chance.
Originally created for the Pyweek compo, this version features many bugfixes and enhancements over the compo version. Thanks to Phil Bordelon for many of these fixes.
Enhancements:
- Very Easy mode is actually playable.

Maintenance for Plone provides a set of scheduled scripts for routine work in a Plone site.
PloneMaintenance consists of a portal_maintenance tool that allows you to define maintenance tasks and scripts to run according to a schedule assigned to the tasks.
No task is going to be run unless it is scheduled to. The schedule information is stored in the task, and even if PloneMaintenance is called many times in a row, it will always look up the schedule information, check when was the last time the task was run, calculate the next time the task is scheduled to run, and depending on this, PloneMaintenance will decide whether it runs the script associated to the task or not.
PloneMaintenance depends on an external tool to wake it up and make it execute the scheduled tasks. Without an external tool, PloneMaintenance will just sit and wait, doing nothing. You can go to the portal_maintenance tool and manually run the maintenance tasks, but most of the time, you want an external tool doing the job automatically.
You can choose one of the Schedulers which are available for Zope, or call PloneMaintenance from a cron job.
Enhancements:
- Fix bug on MaintenanceTask: id was not initialized
- Add "notified_emails" property. When a task has been processed, an email is sent.
- MaintenanceTask no more addable types 2006/07/06 MR

MR Tech Link Wrapper Lite is a Firefox extension that wraps long links and lines to spare you from having to scroll left and right.

Hidden preferences:

- length to wrap: link_wrapper.wrapLength, default value is "15"
- Sites to ignore: link_wrapper.ignoreList, default regex value is "google.com|mail.yahoo.com|hushmail.com|blog.myspace.com|webmail.aol.com"
- html tags to ignore: link_wrapper.ignoreTags, default regex value includes tons of tags
- Enable page character limit to improve performance on large pages: link_wrapper.charLimitEnabled, default value is false
- If enabled use this character limit: link_wrapper.charLimit, default value is 30000

If Link Wrapper doesnt appear to work for you can:

- some blog site will break with this extension just add the domain to the "Sites to ignore" list in the options
- bump the limit of character to something higher than 30000 in the options dialog
- if you experience slow downs on large pages, enabling the character limit in the options dialog.

Note: Link Wrapper will force Linkification to only highlight part of a text link, version 1.2.2 and newer of Linkification adds a "Thorough Mode" which is disabled by default, enabling it will resolve this, or you can just double-click on the unhighlighted text on the right of the text from a link to have it open properly.

IPC is a program that calculates the isotopic distribution of a given chemical formula. It gives the rel. intensities and the propability of the masses belonging to a molecule ion, fragment or whatever is represented by the given chemical formula.
Furthernmore it can use GNUPlot to visualize the result. Only masses with a rel. Intensity bigger then 0.009% are shown. Additionaly ipc prints the overall number of peaks and the needed computation time.
The program uses an algorithm which computes the exact isotopic distribution. This leads to a large number of peaks which have very low rel. abundances. Even for a small molecule as Acetylsalicylic acid ( C9H8O4, Mr=180.15) there are 1350 peaks but only nine of them have a rel. abundance higher then 0.01%.
Enhancements:
- A complete list of elements and isotopes is now used.
- The list of elements is taken from the NIST.