Ports 搜索

"My Mailer" is an incarnation of a UNIX text-based mailer designed to be an intermediate step between mail and pine. Features: MIME aware -- While this mailer does not implement a full set of the MIME mail extensions, it should handle most MIME mail. It also handles some Sun mail attachment formats. Threaded messages -- Articles by default are threaded by subject. This allows one to plow through huge mailing list discussions, sometimes spanning weeks, with very little effort. Automatic detection of a modified mail file, and the changes will then be merged with the current message listing. Automatically uncompresses and recompresses gzipped mailfiles Searchable message listings, including search through message text

Email::Sender replaces the old and sometimes problematic Email::Send library, which did a decent job at handling very simple email sending tasks, but was not suitable for serious use, for a variety of reasons. Most users will be able to use Email::Sender::Simple to send mail. Users with more specific needs should look at the available Email::Sender::Transport classes. Documentation may be found in Email::Sender::Manual, and new users should start with Email::Sender::Manual::QuickStart. This module provides a very simple, very clean, very specific interface to multiple Email mailers. The goal of this software is to be small and simple, easy to use, and easy to extend.

Clawsker is an applet to edit Claws Mail's hidden preferences. Claws Mail has a high number of configurable options and, in order to keep the binary small and fast, some of these preferences which are not widely used are not provided with a graphical interface for inspection and/or modification. Users wanting to edit such preferences had to face editing the configuration text files directly, now it is possible with a convenient GTK2 interface using Clawsker. Other features: * Handling of all hidden preferences * Fully internationalized interface using gettext * Detection of running Claws Mail * Support for alternate configuration directories

This program is for any user who retrieves ftp files via ftpmail or bitftp servers. It runs quietly in the background and watches the user's mail directory. When the mail- retrieved file has arrived in full, rftp puts the pieces together in order and stores the tarball in a directory. I wrote this several years ago when my only link to the Arpanet was a uucp link. These days, most FreeBSD users have a direct link to the net. For the dozens or hundreds who don't this should be of use.

R-psych provides a number of routines for personality, psychometrics and experimental psychology. Functions are primarily for scale construction using factor analysis, cluster analysis and reliability analysis, although others provide basic descriptive statistics. Functions for simulating particular item and test structures are included. Several functions serve as a useful front end for structural equation modeling. Graphical displays of path diagrams, factor analysis and structural equation models are created using basic graphics. Some of the functions are written to support a book on psychometrics as well as publications in personality research.

CLN is a library for computations with all kinds of numbers. It has a rich set of number classes: - Integers (with unlimited precision), - Rational numbers, - Floating-point numbers: Short float, Single float, Double float, Long float (with unlimited precision), - Complex numbers, - Modular integers (integers modulo a fixed integer), - Univariate polynomials. The subtypes of the complex numbers among these are exactly the types of numbers known to the Common Lisp language. Therefore CLN can be used for Common Lisp implementations, giving `CLN' another meaning: it becomes an abbreviation of "Common Lisp Numbers".

Fast Artificial Neural Network Library is a free open source neural network library, which implements multilayer artificial neural networks in C with support for both fully connected and sparsely connected networks. Cross-platform execution in both fixed and floating point are supported. It includes a framework for easy handling of training data sets. It is easy to use, versatile, well documented, and fast. Bindings to more than 15 programming languages are available. An easy to read introduction article and a reference manual accompanies the library with examples and recommendations on how to use the library. Several graphical user interfaces are also available for the library.

Agda is a dependently typed functional programming language: It has inductive families, which are similar to Haskell's GADTs, but they can be indexed by values and not just types. It also has parameterised modules, mixfix operators, Unicode characters, and an interactive Emacs interface (the type checker can assist in the development of your code). Agda is also a proof assistant: It is an interactive system for writing and checking proofs. Agda is based on intuitionistic type theory, a foundational system for constructive mathematics developed by the Swedish logician Per Martin-Lof. It has many similarities with other proof assistants based on dependent types, such as Coq, Epigram and NuPRL.

This package contains code for generating high quality random numbers that follow either a uniform or normal distribution. The generated numbers are suitable for use in statistical applications. The uniform PRNG uses Marsaglia's MWC256 (also known as MWC8222) multiply-with-carry generator, which has a period of 2^8222 and fares well in tests of randomness. It is also extremely fast, between 2 and 3 times faster than the Mersenne Twister. Compared to the mersenne-random package, this package has a more convenient API, is faster, and supports more statistical distributions.

ltl2ba implements an algorithm of P. Gastin and D. Oddoux to generate Buechi automata from linear temporal logic (LTL) formulae. This algorithm generates a very weak alternating automaton and then transforms it into a Buechi automaton, using a generalized Buechi automaton as an intermediate step. Each automaton is simplified on-the-fly in order to save memory and time. As usual the LTL formula is simplified before any treatment. ltl2ba is more efficient than Spin 3.4.1, with regard to the size of the resulting automaton, the time of the computation, and the memory used.